An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times

作者：

Highlights：

• Effective heuristic for the parallel blocking flow shop problem with setup times.

• Performance evaluation of different neighbourhood structures and local searches.

• Performance evaluation of different initial solution procedures.

• The best performing constructive method does not lead to obtaining better solutions.

• The level of setup times has slightly influence on the behavior of heuristics.

摘要

•Effective heuristic for the parallel blocking flow shop problem with setup times.•Performance evaluation of different neighbourhood structures and local searches.•Performance evaluation of different initial solution procedures.•The best performing constructive method does not lead to obtaining better solutions.•The level of setup times has slightly influence on the behavior of heuristics.

论文关键词：Parallel Flow Shop,Sequence-dependent Setup times,Makespan,Distributed Flow Shop,Blocking

论文评审过程：Received 7 March 2021, Revised 29 May 2021, Accepted 29 June 2021, Available online 8 July 2021, Version of Record 12 July 2021.

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