摘要
This paper addresses a distributed lot-streaming permutation flow shop scheduling problem that has various applications in real-life manufacturing systems. We aim to optimally assign jobs to multiple distributed factories and sequence them to minimize the maximum completion time (Makespan). A mathematic model is first developed to describe the considered problem. Then, five meta-heuristics are executed to solve it, including particle swarm optimization, genetic algorithm, harmony search, artificial bee colony, and Jaya algorithm. To improve the performance of these meta-heuristics, we employ Nawaz-Enscore-Ham (NEH) heuristic to initialize populations and propose improved strategies based on the problem's feature. Finally, experiments are carried out based on 120 instances. The performance of improved strategies is verified. Comparisons and discussions show that the artificial bee colony algorithm with improved strategies has the best competitiveness for solving the proposed problem with makespan criteria.
学科与关键词
- Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problemPan, Quan-Ke; Gao, Liang*; Wang, Ling; Liang, Jing; Li, Xin-YuEXPERT SYSTEMS WITH APPLICATIONS, 2019, 124: 309-324.被引 217
- Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardinessAllali, Karam*; Aqil, Said; Belabid, JabraneSIMULATION MODELLING PRACTICE AND THEORY, 2022, 116: 102455.被引 28
- The distributed permutation flow shop to minimise the total flowtimeFernandez-Viagas, Victor*; Perez-Gonzalez, Paz; Framinan, Jose M.COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 118: 464-477.被引 133
