Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem

作者：

Highlights：

• A distributed mixed blocking permutation flow-shop scheduling problem is studied.

• An effective improved NEH is proposed.

• An effective IG method incorporating novel enhanced strategies is presented.

• The proposed methods obtain better results.

摘要

•A distributed mixed blocking permutation flow-shop scheduling problem is studied.•An effective improved NEH is proposed.•An effective IG method incorporating novel enhanced strategies is presented.•The proposed methods obtain better results.

论文关键词：Distributed manufacturing,Flow-shop scheduling,Blocking constraints,Constructive heuristic,Iterated greedy method

论文评审过程：Received 2 December 2020, Revised 2 February 2021, Accepted 15 March 2021, Available online 18 March 2021, Version of Record 30 March 2021.

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