Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43835
Title: A note on scheduling jobs with equal processing times and inclusive processing set restrictions
Authors: Li, CL 
Lee, K
Keywords: Equal processing time jobs
Inclusive processing sets
Parallel machines
Scheduling
Issue Date: 2016
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2016, v. 67, no. 1, p. 83-86 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: We consider the problem of scheduling n jobs on m parallel machines with inclusive processing set restrictions. Each job has a given release date, and all jobs have equal processing times. The objective is to minimize the makespan of the schedule. Li and Li (2015) have developed an O(n 2 +mn log n) time algorithm for this problem. In this note, we present a modified algorithm with an improved time complexity of O(minm, log n s n log n).
URI: http://hdl.handle.net/10397/43835
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.2015.56
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Oct 10, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Oct 16, 2017

Page view(s)

38
Last Week
5
Last month
Checked on Oct 23, 2017

Google ScholarTM

Check

Altmetric



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