Quantum Evolutionary Algorithm for Flexible Job Shop Scheduling Problems

In this paper, a quantum evolutionary algorithm is proposed for flexible job shop scheduling problems with the objective to minimize the makespan. Aiming at the features of the flexible job shop scheduling problems, both the working procedures based encoding method and the machine based decoding method are proposed. Moreover, dynamic rotation angle and jumping gens operator are utilized in the proposed algorithm. Finally, simulation results are provided to demonstrate the effectiveness and the applicability of the proposed algorithm.