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

Saved in:
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!
Description
Summary: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 best of the authors' knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2018.1457812