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...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 57; číslo 1; s. 48 - 60
Hlavní autori:	Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 02.01.2019 Taylor & Francis LLC
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!