Better approximation guarantees for job-shop scheduling
UNSPECIFIED (1997) Better approximation guarantees for job-shop scheduling. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, NEW ORLEANS, LA, JAN 05-07, 1997. Published in: PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS pp. 599-608.Full text not available from this repository.
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein & 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.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
|Journal or Publication Title:||PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS|
|Number of Pages:||10|
|Page Range:||pp. 599-608|
|Title of Event:||8th Annual ACM/SIAM Symposium on Discrete Algorithms|
|Location of Event:||NEW ORLEANS, LA|
|Date(s) of Event:||JAN 05-07, 1997|
Actions (login required)