期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 51, 期 16, 页码 5029-5038出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2013.790571
关键词
scheduling; distributed permutation flowshop; modified iterated greedy algorithm
资金
- National Science Council of the Republic of China (Taiwan) [NSC 100-2221-E-027-040-MY2, NSC 101-2410-H-182-004-MY2]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据