An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown

作者：

Highlights：

• Dynamic flexible job shop scheduling problem with machine breakdown is studied.

• A two-stage algorithm based on convolutional neural network is proposed.

• The improved imperialist competition algorithm is proposed to generate schedules.

• A predictive model is proposed to predict the robustness of scheduling.

摘要

•Dynamic flexible job shop scheduling problem with machine breakdown is studied.•A two-stage algorithm based on convolutional neural network is proposed.•The improved imperialist competition algorithm is proposed to generate schedules.•A predictive model is proposed to predict the robustness of scheduling.

论文关键词：Flexible job shop scheduling problem,Machine breakdown,Dynamic scheduling,Imperialist competition algorithm,Convolutional neural network

论文评审过程：Received 30 November 2021, Revised 19 April 2022, Accepted 28 April 2022, Available online 4 May 2022, Version of Record 7 May 2022.

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