Better approximation guarantees for job-shop scheduling
Conference
·
OSTI ID:476036
- Univ. of Warwick, Conventry (United Kingdom)
- National Univ. of Singapore (Singapore); and others
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.
- OSTI ID:
- 476036
- Report Number(s):
- CONF-970142--; CNN: Project 20244; Project 21726; Grant NSF-STC91-19999; Contract 7141
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scheduling jobs that arrive over time
Job scheduling on a hypercube
Backfilling with guarantees granted upon job submission.
Conference
·
Thu Apr 06 00:00:00 EDT 1995
·
OSTI ID:64945
Job scheduling on a hypercube
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6087363
Backfilling with guarantees granted upon job submission.
Conference
·
Fri Dec 31 23:00:00 EST 2010
·
OSTI ID:1038183