Scheduling with processing set restrictions: A literature update

Joseph Y.-T. Leung and Chung-Lun Li

International Journal of Production Economics, 2016, vol. 175, issue C, 1-11

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.

Keywords: Scheduling; Parallel machines; Processing set restrictions; Computational complexity (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527316000190
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:175:y:2016:i:c:p:1-11

DOI: 10.1016/j.ijpe.2014.09.038

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().