A concise survey of efficiently solvable special cases of the permutation flow-shop problem

— One ofthe earliest results in scheduling theory is an algorithm by S, M. Johnson for scheduling jobs in a two-machine flow-shop to minimize the time at which all jobs are completed. Subsequently, many researchers have efflciently solved special cases of this problem for more than two machines. A concise survey ofsuch resuks ispresented with simple proofs based on the ideas of critical paths, nonbottleneck machines, and machine dominance. This covers most previously known special cases and leads to a few new ones as weü

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

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

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

[4]  Wlodzimierz Szwarc.  On some sequencing problems , 1968 .

[5]  T. Arthanari,et al.  A note on a paper by W. Szwarc , 1971 .

[6]  C. V. Ramamoorthy,et al.  A Scheduling Problem , 1973 .

[7]  Wlodzimierz Szwarc.  A note on mathematical aspects of the 3 × n job‐shop sequencing problem , 1974 .

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  Fennell Burns,et al.  A special case of the 3 × n flow shop problem , 1975 .

[10]  Jatinder N. D. Gupta.  Optimal schedules for special structure flowshops , 1975 .

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

[12]  Tadashi Kurisu.  TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS , 1976 .

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

[14]  Fennell Burns,et al.  Technical Note - Johnson's Three-Machine Flow-Shop Conjecture , 1976, Oper. Res..

[15]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[16]  鍋島 一郎,et al.  Notes on the Analytical Results in Flow Shop Scheduling : Part 2 , 1977 .

[18]  Wlodzimierz Szwarc.  Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem , 1977, Oper. Res..

[19]  Tadashi Kurisu.  TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS , 1977 .

[20]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[21]  Wlodzimierz Szwarc.  Special cases of the flow‐shop problem , 1977 .

[22]  Wlodzimierz Szwarc.  Permutation flow‐shop theory revisited , 1978 .

[23]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[24]  Fennell Burns,et al.  Technical Note - Three-Stage Flow-Shops with Recessive Second Stage , 1978, Oper. Res..

[25]  Jeffrey B. Sidney,et al.  The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations , 1979, Oper. Res..

[26]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[27]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[28]  Clyde L. Monma,et al.  Sequencing to Minimize the Maximum Job Cost , 1980, Oper. Res..