Efficient heuristics for the parallel blocking flow shop scheduling problem

作者：

Highlights：

• New Constructive heuristic for both the PBFSP and the DBFSP.

• Combination of IGA and ILS methods with two types of VNS.

• A MILP model solved for small-sized instances.

• The proposed methods are very effective.

摘要

•New Constructive heuristic for both the PBFSP and the DBFSP.•Combination of IGA and ILS methods with two types of VNS.•A MILP model solved for small-sized instances.•The proposed methods are very effective.

论文关键词：Parallel flow shop,Distributed permutation flow shop,Blocking flow shop,Scheduling

论文评审过程：Received 29 September 2016, Revised 19 December 2016, Accepted 6 January 2017, Available online 6 January 2017, Version of Record 13 January 2017.

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