Please use this identifier to cite or link to this item:
Title: Scheduling with processing set restrictions : a survey
Authors: Leung, Joseph Y.-T.
Li, Chung-Lun
Subjects: Scheduling
Parallel machines
Processing set restrictions
Computational complexity
Worst-case analysis
Issue Date: Dec-2008
Publisher: Elsevier
Source: International journal of production economics, Dec 2008, v. 116, no. 2, p. 251-262.
Abstract: Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. These include "scheduling typed task systems," "multi-purpose machine scheduling," "scheduling with eligibility constraints," "scheduling with processing set restrictions," and "semi-matchings for bipartite graphs." In this paper we survey the state of the art of these problems. Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments. Our emphasis is on polynomial-time algorithms, complexity issues, and approximation schemes. While our main focus is on the makespan objective, other performance criteria are also discussed.
Rights: International Journal of Production Economics © 2008 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.ijpe.2008.09.003
ISSN: 0925-5273
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
60 Final-Version.pdfPre-published version230.63 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.