An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance
作者：
Highlights：
• We study a distributed flowshop problem with preventive maintenance.
• We present a novel multi-start iterated greedy algorithm.
• An improved NEH with dropout is proposed to generate searching starting-point.
• A destruction with the tournament selection is well designed.
• The effective of the iterated greedy is proved by extensive experiments.
摘要
•We study a distributed flowshop problem with preventive maintenance.•We present a novel multi-start iterated greedy algorithm.•An improved NEH with dropout is proposed to generate searching starting-point.•A destruction with the tournament selection is well designed.•The effective of the iterated greedy is proved by extensive experiments.
论文关键词：Distributed permutation flowshop scheduling problem,Makespan,Preventive maintenance,Iterated greedy algorithm,Heuristic methods
论文评审过程：Received 2 September 2020, Revised 16 November 2020, Accepted 10 December 2020, Available online 15 December 2020, Version of Record 24 December 2020.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.114495
