Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
作者：
Highlights：
• Total flowtime minimization for the distributed permutation flowshop is addressed.
• Three novel heuristics are presented to obtain good results in a few minutes.
• Four effective metaheuristics are proposed to further improve the quality of solutions.
• Problem-specific knowledge and accelerations to evaluate neighboring solutions are explored.
• Experimental results show that the presented methods significantly outperform the existing algorithms in the literature.
摘要
•Total flowtime minimization for the distributed permutation flowshop is addressed.•Three novel heuristics are presented to obtain good results in a few minutes.•Four effective metaheuristics are proposed to further improve the quality of solutions.•Problem-specific knowledge and accelerations to evaluate neighboring solutions are explored.•Experimental results show that the presented methods significantly outperform the existing algorithms in the literature.
论文关键词：Scheduling,Flowshop,Artificial bee colony,Scatter search,Iterated local search,Iterated greedy
论文评审过程：Received 17 August 2018, Revised 24 December 2018, Accepted 26 January 2019, Available online 28 January 2019, Version of Record 1 February 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.01.062
