New benchmark algorithm for hybrid flowshop scheduling with identical machines

作者：

Highlights：

• A new metaheuristic is proposed for solving the hybrid flowshop scheduling problem.

• Three novel mechanisms are used to improve the search process.

• The computational results are supportive efficiency and stability of the algorithm.

• The proposed metaheuristic can serve as a strong benchmark algorithm for future studies.

摘要

•A new metaheuristic is proposed for solving the hybrid flowshop scheduling problem.•Three novel mechanisms are used to improve the search process.•The computational results are supportive efficiency and stability of the algorithm.•The proposed metaheuristic can serve as a strong benchmark algorithm for future studies.

论文关键词：Scheduling,Hybrid flowshop,Identical machines,Metaheuristics

论文评审过程：Received 5 June 2020, Revised 21 July 2020, Accepted 10 June 2021, Available online 15 June 2021, Version of Record 24 June 2021.

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