A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

Optimal two‐ and three‐stage production schedules with setup times included

S. M. Johnson · Naval Research Logistics Quarterly · 1954 · 3.2K citations

Management, Industrial Engineering, Operations Management +10

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Muhammad Nawaz, E. Emory Enscore, Inyong Ham · Omega · 1983 · 2.5K citations

Management, Industrial Engineering, Operations Management +10

A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem

Herbert George Campbell, Richard A. Dudek, Milton L. Smith · Management Science · 1970 · 869 citations

Computing, Computer Science, Algorithms +10

Flow-Shop Scheduling with the Branch-and-Bound Method

Graham McMahon, P. G. Burton · Operations Research · 1967 · 152 citations

Management, Industrial Engineering, Operations Management +10

Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

Alain Guinet, Marius M. Solomon · International Journal of Production Research · 1996 · 113 citations

Management, Computer Science, Industrial Engineering +16