Nonpreemptive flowshop scheduling with machine dominance

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

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

Engineering, Smart Manufacturing, Optimal System Design +19

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 Total Tardiness on One Machine is NP-Hard

Jianzhong Du, Joseph Y.‐T. Leung · Mathematics of Operations Research · 1990 · 732 citations

Mathematical Programming, Engineering, Computational Complexity +16

The Three-Machine No-Wait Flow Shop is NP-Complete

Hans Röck · Journal of the ACM · 1984 · 199 citations · Full text

Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

I. Adiri, D. Pohoryles · Naval Research Logistics Quarterly · 1982 · 142 citations