A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm

作者：

Highlights：

• Distributed flexible job shop scheduling problem with worker (DFJSPW) is studied.

• An improved memetic algorithm (IMA) is proposed to solve the DFJSPW.

• An effective encoding and decoding methods are presented in the IMA.

• An adaptive neighbourhood search operator is designed in the IMA.

• Elaborate experiments prove the effectiveness of the IMA in solving the DFJSPW.

摘要

•Distributed flexible job shop scheduling problem with worker (DFJSPW) is studied.•An improved memetic algorithm (IMA) is proposed to solve the DFJSPW.•An effective encoding and decoding methods are presented in the IMA.•An adaptive neighbourhood search operator is designed in the IMA.•Elaborate experiments prove the effectiveness of the IMA in solving the DFJSPW.

论文关键词：Distributed flexible job shop scheduling,Worker arrangement,Memetic algorithm,Adaptive neighborhood search

论文评审过程：Received 30 August 2021, Revised 10 June 2022, Accepted 24 June 2022, Available online 30 June 2022, Version of Record 7 July 2022.

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