Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61124
Title: Scheduling with processing set restrictions : a literature update
Authors: Leung, JYT
Li, CL 
Keywords: Computational complexity
Parallel machines
Processing set restrictions
Scheduling
Issue Date: 2016
Publisher: Elsevier
Source: International journal of production economics, 2016, v. 175, p. 1-11 How to cite?
Journal: International journal of production economics 
Abstract: In 2008, we published a survey paper on machine scheduling with processing set restrictions [Leung, J.Y.-T., Li, C.-L., 2008. Scheduling with processing set restrictions: a survey. Int. J. Prod. Econ. 116 (2), 251-262]. Since the appearance of that survey paper, there has been a significant increase in interest in this field. In this paper, we provide an expository update of this line of research. Our survey covers five types of processing set restrictions, namely inclusive processing sets, nested processing sets, interval processing sets, tree-hierarchical processing sets, and arbitrary processing sets, and it covers both offline and online problems. While our main focus is on scheduling models with a makespan objective, other performance criteria are also discussed.
URI: http://hdl.handle.net/10397/61124
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2014.09.038
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

4
Last Week
0
Last month
Citations as of Jun 22, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
Citations as of May 26, 2017

Page view(s)

13
Last Week
1
Last month
Checked on Jun 18, 2017

Google ScholarTM

Check

Altmetric



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