Better approximation guarantees for job-shop scheduling
Goldberg, L.A., Paterson, M.S., Srinavasan, A. and Sweedyk, E. (1996) Better approximation guarantees for job-shop scheduling. Technical Report. Department of Computer Science, Coventry, UK.
- Published Version
Download (1346Kb) | Preview
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). Some of these improvements represent the first constant-factor approximation algorithms. We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.
|Item Type:||Monograph (Technical Report)|
|Additional Information:||L.A. Goldberg, M.S. Paterson, A. Srinivasan and E. Sweedyk, “Better Approximation Guarantees for Job-shop Scheduling”, <i>Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, pp. 599-608 (1997)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||03 Jan 2012 10:30|
|Last Modified:||01 Nov 2012 18:06|
Actions (login required)