期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 139, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2019.07.041
关键词
Flexible flow-shop scheduling; Dynamic waiting times; Integrated scheduling; Iterated greedy algorithm; Makespan
资金
- National Natural Science Foundation of China [71301008]
- Natural Science Foundation of Beijing Municipality [9144030]
Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flow shop scheduling problem in smart manufacturing system. In this problem, jobs need to be transported by transporters like AGV (Automated Guided Vehicle) to next stage after processing. During transportation, waiting time dynamically occurs for both jobs and transporters, and finally contributes to makespan. The waiting times are conditioned by buffer capacity, machine allocations and production sequence. In order to minimize makespan with consideration of dynamic waiting times, we proposed a waiting time calculation approach to evaluate waiting time and makespan. This approach considers two situations: infinite buffer capacity and zero buffer capacity. Further, we developed a memetic algorithm integrated with waiting time calculation approach to solve FFSPDW. Finally, we verified the algorithm parameters via analysis of variance. Computational results show that the proposed memetic algorithm is able to reach high quality solutions with short computation time. Consequently, the proposed approach is suitable for solving industrial FFSPDW problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据