A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times

作者：

Highlights：

• Study a new two-machine FSGS problem.

• Prove this problem is strongly NP-hard.

• Consider it as a joint decision and propose a co-evolutionary genetic algorithm.

• Design a block-mining-based artificial chromosome construction strategy.

摘要

•Study a new two-machine FSGS problem.•Prove this problem is strongly NP-hard.•Consider it as a joint decision and propose a co-evolutionary genetic algorithm.•Design a block-mining-based artificial chromosome construction strategy.

论文关键词：Flow shop group scheduling,Job-related blocking time,Transportation time,Co-evolutionary genetic algorithm

论文评审过程：Received 24 June 2019, Revised 4 March 2020, Accepted 5 March 2020, Available online 6 March 2020, Version of Record 13 March 2020.

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