A speed-up procedure for the hybrid flow shop scheduling problem

作者：

Highlights：

• We address the hybrid flow shop scheduling problem to minimise makespan.

• We develop a novel speed up procedure for the problem.

• We incorporate the proposed accelerations in a basic iterated greedy algorithm.

• We compare the proposal with the most promising metaheuristics in the literature.

摘要

•We address the hybrid flow shop scheduling problem to minimise makespan.•We develop a novel speed up procedure for the problem.•We incorporate the proposed accelerations in a basic iterated greedy algorithm.•We compare the proposal with the most promising metaheuristics in the literature.

论文关键词：Scheduling,Hybrid flowshop,Iterated greedy,Speed-up,Accelerations,Critical path,Makespan,Computational evaluation,HFS

论文评审过程：Received 18 May 2021, Revised 3 August 2021, Accepted 10 September 2021, Available online 21 September 2021, Version of Record 1 October 2021.

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