.png){kind=icon}
Return
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2013.790571.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The distributed permutation flowshop scheduling problem (DPFSP) is a newly proposed topic in the shop scheduling field, which has important application in globalised and multi-plant environments. This study presents a modified iterated greedy (MIG) algorithm for this problem to minimise the maximum completion time among all the factories. Compared with previous approaches, the proposed algorithm is simpler yet more effective, more efficient, and more robust in solving the DPFSP. To validate the performance of the proposed MIG algorithm, computational experiments and comparisons are conducted on an extended benchmark problem set of Taillard. Despite its simplicity, the computational results show that the proposed MIG algorithm outperforms all existing algorithms, and the best-known solutions for almost half of instances are updated. This study can be offered as a contribution to the growing body of work on both theoretically and practically useful approaches to the DPFSP.
Keywords:
scheduling
distributed permutation flowshop
modified iterated greedy algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveSolving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more