Minimising makespan in distributed mixed no-idle flowshops

The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the bes...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research Jg. 57; H. 1; S. 48 - 60
Hauptverfasser:	Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 02.01.2019 Taylor & Francis LLC
Schlagworte:	cloud theory-based iterated greedy algorithm distributed mixed no-idle flowshop Greedy algorithms Job shops makespan metaheuristics Optimality criteria Production scheduling Scheduling
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!