On the dominance of permutation schedules for some ordered and proportionate flow shop problems

We consider the ordered and the proportionate flow shop with unequal machine speeds.We consider both the Cmax and the j=1nCj objectives.We show that permutation schedules are dominant for Cmax with V-shaped speeds.We show that permutation schedules are dominant for j=1nCj with three stages.

[1]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

[2]  Ching-Jen Huang,et al.  Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness , 2010, Appl. Math. Comput..

[3]  Christos Koulamas,et al.  Scheduling research and the first decade of NRLQ: A historical perspective , 2015 .

[4]  L. G. Mitten.  Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[5]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[6]  S. S. Panwalkar,et al.  Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[7]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .

[8]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[9]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[10]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling. New York: John Wiley & Sons , 2009 .

[11]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[12]  Francis Y. L. Chin,et al.  On J-maximal and J-minimal Flow-Shop Schedules , 1981, JACM.

[13]  Byung-Cheon Choi,et al.  Minimizing maximum completion time in a proportionate flow shop with one machine of different speed , 2007, Eur. J. Oper. Res..

[14]  S. S. Panwalkar,et al.  An ordered flow-shop sequencing problem with mean completion time criterion† , 1976 .

[15]  Rasaratnam Logendran,et al.  Non-permutation flowshop scheduling with dual resources , 2013, Expert Syst. Appl..

[16]  Han Hoogeveen,et al.  Minimizing total weighted completion time in a proportionate flow shop , 1998 .

[17]  Marcus Ritt,et al.  Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops , 2016, Comput. Oper. Res..

[18]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[19]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[20]  Selmer Martin Johnson,et al.  Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[21]  I. Hamilton Emmons,et al.  Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .