A memetic algorithm based on Immune multi-objective optimization for flexible job-shop scheduling problems

The flexible job-shop scheduling problem (FJSP) is an extension of the classical job scheduling which is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying parallel goals. This paper addresses the FJSP with two objectives: Minimize makespan, Minimize total operation cost. We introduce a memetic algorithm based on the Nondominated Neighbor Immune Algorithm (NNIA), to tackle this problem. The proposed algorithm adds, to NNIA, local search procedures including a rational combination of undirected simulated annealing (UDSA) operator, directed cost simulated annealing (DCSA) operator and directed makespan simulated annealing (DMSA) operator. We have validated its efficiency by evaluating the algorithm on multiple instances of the FJSPs. Experimental results show that the proposed algorithm is an efficient and effective algorithm for the FJSPs, and the combination of UDSA operator, DCSA operator and DMSA operator with NNIA is rational.