A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

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

Bounds on Multiprocessing Timing Anomalies

Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations

Computing, Computer Science, Computer Systems +13

Integer Programming with a Fixed Number of Variables

H. W. Lenstra · Mathematics of Operations Research · 1983 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +12

Using dual approximation algorithms for scheduling problems theoretical and practical results

Dorit S. Hochbaum, David B. Shmoys · Journal of the ACM · 1987 · 779 citations · Full text

Computing, Computer Science, Mathematics +16