Skip to main content

Constructive Heuristics in Hybrid Flow Shop Scheduling with Unrelated Machines and Setup Times

  • 732 Accesses

Part of the Operations Research Proceedings book series (ORP)

Abstract

Hybrid flow shop (HFS) systems represent the typical flow shop production system with parallel machines on at least one stage of operation. This paper considers unrelated machines and anticipatory sequence-dependent setup times where job families can be formed based on similar setup characteristics. This results in the opportunity to save setups if two jobs of the same family are scheduled consecutively. Three constructive heuristic approaches, aiming at minimization of makespan, total completion time and the total number of setup procedures, are implemented based on the algorithm of Nawaz, Enscore and Ham (NEH).

Keywords

  • Hybrid flow shop scheduling
  • Unrelated machines
  • Setup times
  • Constructive heuristics

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-48439-2_69
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   169.00
Price excludes VAT (USA)
  • ISBN: 978-3-030-48439-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   219.99
Price excludes VAT (USA)
Fig. 1

References

  1. Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2), 345–378 (2015)

    Google Scholar 

  2. Ebrahimi, M., Ghomi, S.M.T.F., Karimi, B.: Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl. Math. Model. 38(9–10), 2490–2504 (2014)

    Google Scholar 

  3. Fernandez-Viagas, V., Molina-Pariente, J.M., Framiñan, J.M.: New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics. Expert Syst. Appl. 114, 345–356 (2018)

    Google Scholar 

  4. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Google Scholar 

  5. Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., Werner, F.: An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg 28(5), 1–23 (2005)

    Google Scholar 

  6. Lee, C.-Y., Vairaktarakis, G.L.: Minimizing makespan in hybrid flowshops. Oper. Res. Lett. 16(3), 149–158 (1994)

    Google Scholar 

  7. Mirsanei, H.S., Zandieh, M., Moayed, M.J., Khabbazi, M.R.: A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. J. Intell. Manuf. 22(6), 965–978 (2011)

    Google Scholar 

  8. Naderi, B., Gohari, S., Yazdani, M.: Hybrid flexible flowshop problems: Models and solution methods. Appl. Math. Model. 38(24), 5767–5780 (2014)

    Google Scholar 

  9. Naderi, B., Zandieh, M., Balagh, A.K.G., Roshanaei, V.: An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 36(6), 9625–9633 (2009)

    Google Scholar 

  10. Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)

    Google Scholar 

  11. Rashidi, E., Jahandar, M., Zandieh, M.: An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int. J. Adv. Manuf. Technol. 49(9–12), 1129–1139 (2010)

    Google Scholar 

  12. Ribas, I., Leisten, R., Framiñan, J.M.: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8), 1439–1454 (2010)

    Google Scholar 

  13. Ruiz, R., Şerifoğlu, F.S., Urlings, T.: Modeling realistic hybrid flexible flowshop scheduling problems. Comput. Oper. Res. 35(4), 1151–1175 (2008)

    Google Scholar 

  14. Ruiz, R., Vázquez-Rodríguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1–18 (2010)

    Google Scholar 

  15. Shahvari, O., Logendran, R.: A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. Int. J. Prod. Econ. 195, 227–248 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Hipp .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Hipp, A., Geldermann, J. (2020). Constructive Heuristics in Hybrid Flow Shop Scheduling with Unrelated Machines and Setup Times. In: Neufeld, J.S., Buscher, U., Lasch, R., Möst, D., Schönberger, J. (eds) Operations Research Proceedings 2019. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-48439-2_69

Download citation