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.
Abstract
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.
Actions (login required)
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png)
