Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1834
Title: Scheduling parallel machines with inclusive processing set restrictions and job release times
Authors: Li, CL 
Wang, X
Keywords: Scheduling
Parallel machines
Release times
Worst-case analysis
Polynomial time approximation scheme
Issue Date: 1-Feb-2010
Publisher: Elsevier
Source: European journal of operational research, 1 Feb. 2010, v. 200, no. 3, p. 702-710 How to cite?
Journal: European Journal of Operational Research 
Abstract: We consider the problem of scheduling a set of jobs with different release times on parallel machines so as to minimize the makespan of the schedule. The machines have the same processing speed, but each job is compatible with only a subset of those machines. The machines can be linearly ordered such that a higher-indexed machine can process all those jobs that a lower-indexed machine can process. We present an efficient algorithm for this problem with a worst-case performance ratio of 2. We also develop a polynomial time approximation scheme (PTAS) for the problem, as well as a fully polynomial time approximation scheme (FPTAS) for the case in which the number of machines is fixed.
URI: http://hdl.handle.net/10397/1834
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.02.011
Rights: European Journal of Operational Research © 2009 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 
63 Final-Version.pdfPre-published version219.15 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

13
Last Week
2
Last month
0
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Aug 25, 2016

Page view(s)

324
Last Week
3
Last month
Checked on Aug 21, 2016

Download(s)

379
Checked on Aug 21, 2016

Google ScholarTM

Check

Altmetric



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