A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem

作者：

Highlights：

• A novel cooperative co-evolutionary approach for the no-wait job shop problem.

• A shift decoding algorithm to determine jobs’ start time to find good schedules.

• A novel combination of a permutation and a binary vector for solution representation.

• Comparison with four state-of-the-art approaches.

• Four new best solutions for benchmark instances.

摘要

•A novel cooperative co-evolutionary approach for the no-wait job shop problem.•A shift decoding algorithm to determine jobs’ start time to find good schedules.•A novel combination of a permutation and a binary vector for solution representation.•Comparison with four state-of-the-art approaches.•Four new best solutions for benchmark instances.

论文关键词：Scheduling,No-wait,Job shop,Makespan,Cooperative coevolutionary,Genetic algorithm,Timetabling

论文评审过程：Received 16 March 2021, Revised 21 December 2021, Accepted 1 January 2022, Available online 19 January 2022, Version of Record 24 January 2022.

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