Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1849
Title: Scheduling with processing set restrictions : a survey
Authors: Leung, JY
Li, CL 
Keywords: 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 How to cite?
Journal: International Journal of Production Economics 
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.
URI: http://hdl.handle.net/10397/1849
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2008.09.003
Rights: International Journal of Production Economics © 2008 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
60 Final-Version.pdfPre-published version230.63 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

66
Last Week
1
Last month
1
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

59
Last Week
0
Last month
2
Citations as of Sep 26, 2016

Page view(s)

312
Last Week
0
Last month
Checked on Sep 25, 2016

Download(s)

1,002
Checked on Sep 25, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.