.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
scheduling
distributed permutation flowshop
modified iterated greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
PREAI
分享收藏分享收藏An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem一种求解分布式置换流水车间调度问题的有效禁忌搜索算法
PREAI
分享收藏
查看更多内容