Parallel machine scheduling with additional resources: Notation, classification, models and solution methods

•We review the literature on parallel machine scheduling with additional resources.•We structure the review around five categories.•We provide both the strengths and weaknesses of the studies together with open areas.•We propose several extensions on some of the mathematical models given in the lite...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 2013-11, Vol.230 (3), p.449-463
Hauptverfasser: Edis, Emrah B., Oguz, Ceyda, Ozkarahan, Irem
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We review the literature on parallel machine scheduling with additional resources.•We structure the review around five categories.•We provide both the strengths and weaknesses of the studies together with open areas.•We propose several extensions on some of the mathematical models given in the literature.•We conclude with several remarks based on our computational studies and the review. Majority of parallel machine scheduling studies consider machine as the only resource. However, in most real-life manufacturing environments, jobs may require additional resources, such as automated guided vehicles, machine operators, tools, pallets, dies, and industrial robots, for their handling and processing. This paper presents a review and discussion of studies on the parallel machine scheduling problems with additional resources. Papers are surveyed in five main categories: machine environment, additional resource, objective functions, complexity results and solution methods, and other important issues. The strengths and weaknesses of the literature together with open areas for future studies are also emphasized. Finally, extensions of integer programming models for two main classes of related problems are given and conclusions are drawn based on computational studies.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.02.042