Minimizing total completion time for re-entrant flow shop scheduling problems

The Complexity of Flowshop and Jobshop Scheduling

M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations

Engineering, Problem Size, Computational Complexity +18

Minimizing Makespan in a Class of Reentrant Shops

M. Y. Wang, Suresh Sethi, Steef van de Velde · Operations Research · 1997 · 114 citations

Mathematical Programming, Engineering, Reentrant Shops +22

A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem

Jen-Shiang Chen, Jason Chao-Hsien Pan, Chien-Min Lin · Expert Systems with Applications · 2006 · 93 citations

Engineering, Industrial Engineering, Scheduling Problem +11

Minimizing makespan in re-entrant permutation flow-shops

J. C.-H. Pan, J-S Chen · Journal of the Operational Research Society · 2003 · 74 citations

Mean Flow Time Minimization in Reentrant Job Shops with a Hub

Wiesław Kubiak, Sheldon Lou, Yingmeng Wang · Operations Research · 1996 · 69 citations

Mathematical Programming, Cluster Computing, Engineering +21