Flexible job shop scheduling based on improved hybrid immune algorithm

Abstract

An improved hybrid immune algorithm (HIA) with parallelism and adaptability is proposed to solve the flexible job shop scheduling problem. In order to represent the actual characteristics of the problem’s solution, in the algorithm the author uses a hybrid encoding method of piece—machine. Firstly, adaptive crossover operator and mutation operator are designed based on the encoding antibody method and the affinity calculation based on group matching is adopted. Secondly, the algorithm uses adaptive crossover probability and mutation probability in the operation of immune for the antibody population. The new antibody after crossing can automatically meet the constraints of the problem. Next, a hybrid algorithm based on simulated annealing algorithm is introduced to avoid the local optimization in this paper. Finally, it is demonstrated the effectiveness of the proposed algorithm through the simulation and comparison with some existing algorithms.