Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem

作者：

Highlights：

• A distributed hybrid flow shop scheduling with makespan criterion is studied.

• A DNEH_SMR based on decomposition and small–medium rule is proposed.

• An IG with multi-search construction and local search is proposed.

• The DNEH_SMR and IG are competitive algorithms for solving the DHFSP.

摘要

•A distributed hybrid flow shop scheduling with makespan criterion is studied.•A DNEH_SMR based on decomposition and small–medium rule is proposed.•An IG with multi-search construction and local search is proposed.•The DNEH_SMR and IG are competitive algorithms for solving the DHFSP.

论文关键词：Distributed hybrid flow shop scheduling problem,Iterated greedy algorithm,Multi-neighborhood,Decomposition based heuristic,Makespan

论文评审过程：Received 11 July 2019, Revised 8 January 2020, Accepted 13 January 2020, Available online 18 January 2020, Version of Record 18 May 2020.

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