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

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 57; no. 1; pp. 48 - 60
Main Authors:	Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 02.01.2019 Taylor & Francis LLC
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!