Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms

作者：

Highlights：

• Three variants of IG algorithms are presented based on VNS, VND, RNS to solve the distributed no-wait flow shop scheduling problem (DNWFSP).

• An improved NEH heuristic is proposed to generate a promising initial solution.

• Four local search methods based on neighborhood properties are proposed.

• Several speed-up methods are investigated to reduce the evaluation.

• The best solutions of 720 instances for DNWFSP are proposed.

摘要

• Three variants of IG algorithms are presented based on VNS, VND, RNS to solve the distributed no-wait flow shop scheduling problem (DNWFSP).• An improved NEH heuristic is proposed to generate a promising initial solution.• Four local search methods based on neighborhood properties are proposed.• Several speed-up methods are investigated to reduce the evaluation.• The best solutions of 720 instances for DNWFSP are proposed.

论文关键词：Distributed no-wait flow shop scheduling problem,Makespan,Iterated greedy algorithm,Neighborhood structures,Local search

论文评审过程：Received 16 March 2017, Revised 25 July 2017, Accepted 18 September 2017, Available online 20 September 2017, Version of Record 18 October 2017.

论文官网地址：https://doi.org/10.1016/j.knosys.2017.09.026