Sciweavers

SODA
1997
ACM

Better Approximation Guarantees for Job-shop Scheduling

13 years 5 months ago
Better Approximation Guarantees for Job-shop Scheduling
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. Key words. approximation, guarantees, job-shop, scheduling AMS subject classifications. 68Q25, 68R05 PII. S0895480199326104
Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1997
Where SODA
Authors Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
Comments (0)