Job shop scheduling with a combination of four buffering constraints

In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 56; H. 9; S. 3274 - 3293
Hauptverfasser: Liu, Shi Qiang, Kozan, Erhan, Masoud, Mahmoud, Zhang, Yu, Chan, Felix T.S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 03.05.2018
Taylor & Francis LLC
Schlagworte:
Algorithms
best-insertion-heuristic algorithm
blocking
buffer management
Buffers
constructive algorithm
Gantt charts
Heuristic methods
Integer programming
Job shop scheduling
Job shops
Mixed integer
mixed integer programming
no-wait
Organic chemistry
Production scheduling
Scheduling
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling and analysing many real-world scheduling systems in chemical, food, manufacturing, railway, health care and aviation industries. Critical problem properties are thoroughly analysed in terms of the Gantt charts. Based on these properties, an applicable mixed integer programming model is formulated and an efficient heuristic algorithm is developed. Computational experiments show that the proposed heuristic algorithm is satisfactory for solving the CBJSS in real time.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2017.1401240