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

• 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. In the actual manufacturing process, the environment of the job shop is complex. There will be many kinds of uncertainties such as random job arrivals, machine breakdowns, order cancellations and other dynamic events. In this paper, an effective two-stage algorithm based on convolutional neural network is proposed to solve the flexible job shop scheduling problem (FJSP) with machine breakdown. A bi-objective dynamic flexible job shop scheduling problem (DFJSP) model with the objective of maximum completion time and robustness is established. In the two-stage algorithm, the first stage is to train the prediction model by convolutional neural network (CNN). The second stage is to predict the robustness of scheduling through the model trained in the first stage. First, an improved imperialist competition algorithm (ICA) is proposed to generate training data. Then, a predictive model constructed by CNN was proposed, and an alternative metric called RMn was developed to evaluate robustness. RMn evaluates that the float time has an effect on the robustness through the information of machine breakdown, workload and float time of the operation. The experimental results show that the proposed two-stage algorithm is effective for solving DFJSP, and RMn can evaluate the robustness of scheduling more quickly, efficiently and accurately.