Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph

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

The Complexity of Flowshop and Jobshop Scheduling

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

Computing, Computer Science, Algorithms +12

Scheduling subject to resource constraints: classification and complexity

Jan Karel Lenstra, A. H. G. Rinnooy Kan · Discrete Applied Mathematics · 1983 · 1.4K citations

Management, Industrial Engineering, Operations Management +9

The Planar Hamiltonian Circuit Problem is NP-Complete

M. R. Garey, D. S. Johnson, Robert E. Tarjan · SIAM Journal on Computing · 1976 · 529 citations

Computing, Computer Science, Mathematics +7

Flowshop and Jobshop Schedules: Complexity and Approximation

Teofilo F. Gonzalez, Sartaj Sahni · Operations Research · 1978 · 427 citations

Management, Industrial Engineering, Operations Management +13