Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/36107
Title: Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions
Authors: Li, CL 
Li, QY
Keywords: Scheduling
Parallel machines
Equal processing time jobs
Inclusive processing sets
Issue Date: 2015
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2015, v. 66, no. 3, p. 516-523 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: We consider the problem of scheduling a given set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a given release date and is compatible to only a subset of the machines. The machines are ordered and indexed in such a way that a higher-indexed machine can process all the jobs that a lower-indexed machine can process. We present a solution procedure to solve this problem in 0(n(2)+ mnlogn) time. We also extend our results to the tree-hierarchical processing sets case and the uniform machine case.
URI: http://hdl.handle.net/10397/36107
ISSN: 0160-5682 (print)
1476-9360 (online)
DOI: 10.1057/jors.2014.22
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Citations as of Feb 25, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Feb 27, 2017

Page view(s)

11
Last Week
0
Last month
Checked on Feb 26, 2017

Google ScholarTM

Check

Altmetric



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