Skip to main content
Top

2020 | OriginalPaper | Chapter

Diversity of Processing Times in Permutation Flow Shop Scheduling Problems

Authors : Kathrin Maassen, Paz Perez-Gonzalez

Published in: Operations Research Proceedings 2019

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In static-deterministic flow shop scheduling, solution algorithms are often tested by problem instances with uniformly distributed processing times. However, there are scheduling problems where a certain structure, variability or distribution of processing times appear. While the influence of these aspects on common objectives, like makespan and total completion time, has been discussed intensively, the efficiency-oriented objectives core idle time and core waiting time have not been taken into account so far. Therefore, a first computational study using complete enumeration is provided to analyze the influence of different structures of processing times on core idle time and core waiting time. The results show that in some cases an increased variability of processing times can lead to easier solvable problems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Benkel, K., Jørnsten, K., Leisten, R.: Variability aspects in flowshop scheduling systems. In: International Conference on Industrial Engineering and Systems Management (IESM) (2015), pp. 118–127 Benkel, K., Jørnsten, K., Leisten, R.: Variability aspects in flowshop scheduling systems. In: International Conference on Industrial Engineering and Systems Management (IESM) (2015), pp. 118–127
2.
go back to reference De Matta, R.: Minimizing the total waiting time of intermediate products in a manufacturing process. Int. Trans. Oper. Res. 26(3), 1096–1117 (2019) De Matta, R.: Minimizing the total waiting time of intermediate products in a manufacturing process. Int. Trans. Oper. Res. 26(3), 1096–1117 (2019)
3.
go back to reference Fernandez-Viagas, V., Framinan, J.M.: Reduction of permutation flowshop problems to single machine problems using machine dominance relations. Comput. Oper. Res. 77, 96–110 (2017) Fernandez-Viagas, V., Framinan, J.M.: Reduction of permutation flowshop problems to single machine problems using machine dominance relations. Comput. Oper. Res. 77, 96–110 (2017)
4.
go back to reference Framinan, J.M., Perez-Gonzalez, P.: On heuristic solutions for the stochastic flowshop scheduling problem. Eur. J. Oper. Res. 246(2), 413–420 (2015) Framinan, J.M., Perez-Gonzalez, P.: On heuristic solutions for the stochastic flowshop scheduling problem. Eur. J. Oper. Res. 246(2), 413–420 (2015)
5.
go back to reference Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979) Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)
6.
go back to reference Juan, A.A., Barrios, B.B., Vallada, E., Riera, D., Jorba, J.: A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simul. Model. Pract. Theory 46, 101–117 (2014) Juan, A.A., Barrios, B.B., Vallada, E., Riera, D., Jorba, J.: A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simul. Model. Pract. Theory 46, 101–117 (2014)
7.
go back to reference Liu, W., Jin, Y., Price, M.: A new heuristic to minimize system idle time for flowshop scheduling. In: Poster presented at the 3rd Annual EPSRC Manufacturing the Future Conference, Glassgow (2014) Liu, W., Jin, Y., Price, M.: A new heuristic to minimize system idle time for flowshop scheduling. In: Poster presented at the 3rd Annual EPSRC Manufacturing the Future Conference, Glassgow (2014)
8.
go back to reference Monma, C.L., Kan, A.R.: A concise survey of efficiently solvable special cases of the permutation flow-shop problem. RAIRO Oper. Res. 17(2), 105–119 (1983) Monma, C.L., Kan, A.R.: A concise survey of efficiently solvable special cases of the permutation flow-shop problem. RAIRO Oper. Res. 17(2), 105–119 (1983)
9.
go back to reference Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2016) Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2016)
10.
go back to reference Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5–13 (1995) Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5–13 (1995)
11.
go back to reference Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity and Computation. Martinus Nijhoff, The Hague (1976) Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity and Computation. Martinus Nijhoff, The Hague (1976)
12.
go back to reference Schollenberger, H.: Analyse und Verbesserung der Arbeitsabläufe in Betrieben der Reparaturlackierung, Univ.-Verlag Karlsruhe (2006) Schollenberger, H.: Analyse und Verbesserung der Arbeitsabläufe in Betrieben der Reparaturlackierung, Univ.-Verlag Karlsruhe (2006)
13.
go back to reference Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993) Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)
14.
go back to reference Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3), 666–677 (2015) Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3), 666–677 (2015)
15.
go back to reference Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.:. Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS J. Comput. 14(2), 98–123 (2002) Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.:. Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS J. Comput. 14(2), 98–123 (2002)
Metadata
Title
Diversity of Processing Times in Permutation Flow Shop Scheduling Problems
Authors
Kathrin Maassen
Paz Perez-Gonzalez
Copyright Year
2020
DOI
https://doi.org/10.1007/978-3-030-48439-2_67

Premium Partner