Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks

作者：

Highlights：

• This paper is the first research to solve the distributed hybrid flowshop scheduling problem.

• The proposed SIG algorithm provides a practical means of solving this problem.

• This study contributes significantly to expand the research on distributed scheduling problems.

摘要

•This paper is the first research to solve the distributed hybrid flowshop scheduling problem.•The proposed SIG algorithm provides a practical means of solving this problem.•This study contributes significantly to expand the research on distributed scheduling problems.

论文关键词：Self-tuning iterated greedy algorithm,Adaptive cocktail decoding mechanism,Scheduling,Distributed hybrid flowshop

论文评审过程：Received 20 June 2016, Revised 8 September 2017, Accepted 12 September 2017, Available online 14 September 2017, Version of Record 26 September 2017.

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