Garey, M. R.; Johnson, D. S.; Sethi, Ravi The complexity of flow shop and jobshop scheduling. (English) Zbl 0396.90041 Math. Oper. Res. 1, 117-129 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 327 Documents MSC: 90B35 Deterministic scheduling theory in operations research 90C90 Applications of mathematical programming 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods Keywords:Complexity; Flow Shop Scheduling; Jobshop Scheduling; Np-Complete Problems PDF BibTeX XML Cite \textit{M. R. Garey} et al., Math. Oper. Res. 1, 117--129 (1976; Zbl 0396.90041) Full Text: DOI