The Library
Better approximation guarantees for job-shop scheduling
Tools
Tools
Tools
Goldberg, Leslie Ann, Paterson, Michael S., Srinivasan, Aravind and Sweedyk, Elizabeth (1997) Better approximation guarantees for job-shop scheduling. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, New Orleans, LA, 05-07 Jan 1997. Published in: SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms pp. 599-608. ISBN 0898713900.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dl.acm.org/citation.cfm?id=314161.314395
Abstract
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 (Paper) | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Journal or Publication Title: | SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms | ||||
| Publisher: | SIAM | ||||
| ISBN: | 0898713900 | ||||
| Official Date: | 5 January 1997 | ||||
| Dates: |
|
||||
| Number of Pages: | 10 | ||||
| Page Range: | pp. 599-608 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Conference Paper Type: | Paper | ||||
| Title of Event: | 8th Annual ACM/SIAM Symposium on Discrete Algorithms | ||||
| Type of Event: | Other | ||||
| Location of Event: | New Orleans, LA | ||||
| Date(s) of Event: | 05-07 Jan 1997 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
