UNSPECIFIED. (2001) Better approximation guarantees for job-shop scheduling. SIAM JOURNAL ON DISCRETE MATHEMATICS, 14 (1). pp. 67-92. ISSN 0895-4801

Full text not available from this repository.

Abstract

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the rst 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:	Journal Article
Subjects:	Q Science > QA Mathematics
Journal or Publication Title:	SIAM JOURNAL ON DISCRETE MATHEMATICS
Publisher:	SIAM PUBLICATIONS
ISSN:	0895-4801
Date:	2001
Volume:	14
Number:	1
Number of Pages:	26
Page Range:	pp. 67-92
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/12315

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item