Answers are grounded in this paper and cite their sources.
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.
No takes yet. Share an insight, caveat, or question.
Goldberg et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: