An improved quantum genetic algorithm based on MAGTD for dynamic FJSP

For the purpose of solving the dynamic flexible job-shop scheduling problem, this paper establishes the mathematical model to minimize the makespan and stability value, an improved double chains quantum genetic algorithm was proposed. Firstly, it is proposed that the method of double chains structure coding including machine allocation chain and process chain. Secondly, it is proposed that non- dominated sorting based on the crowding distance selection strategy. Thirdly, the most satisfying solution is obtained through the multi-attribute grey target decision model. Finally, the novel method is applied to the Brandimarte example and a dynamic simulation, the result of comparing with other classical algorithms verifies its effectiveness.