Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

作者：

Highlights：

• We address the permutation flow shop to minimise total tardiness.

• We propose an efficient constructive heuristic using a beam-search-based approach.

• We propose an iterated greedy algorithm for the problem.

• We compare several types of destruction-construction phases.

• We conduct a comprehensive evaluation of a total of 23 algorithms.

摘要

•We address the permutation flow shop to minimise total tardiness.•We propose an efficient constructive heuristic using a beam-search-based approach.•We propose an iterated greedy algorithm for the problem.•We compare several types of destruction-construction phases.•We conduct a comprehensive evaluation of a total of 23 algorithms.

论文关键词：Scheduling,Flowshop,Heuristics,PFSP,Tardiness,Beam search,Iterated greedy algorithm,Iterated local search

论文评审过程：Received 30 June 2017, Revised 15 September 2017, Accepted 23 October 2017, Available online 25 October 2017, Version of Record 5 November 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.10.050