Multi-objective Flexible Job Shop Scheduling based on Improved NSGA2 Algorithm
CHEN Fubin
LI Zhongxue
YANG Xijuan
Abstract：Flexible Job Shop Scheduling Problem (FJSP) is an important extension of the classic job shop scheduling problem where each operation can be handled on multiple machines and vice versa. Combined with the actual production process of processing time, machine load, operating costs and other conditions, a multi-objective scheduling model is established. Aiming at the defect of insufficient convergence of NSGA2 algorithm, the immune balance principle is introduced to improve the selection strategy and elite retention strategy of NSGA2 algorithm, avoiding the local convergence problem and improving the optimization performance of the algorithm. By comparing with heuristic rules and various intelligent algorithms, the improved NASA2 algorithm can get a better solution. Using improved NAGA2 algorithm to solve the case not only effectively overcomes the barriers in order of magnitude and dimension of the objectives, but also obtains a satisfactory pareto solution set, further verifying the feasibility of the algorithm and the model.
Keywords：flexible job shop manufacturingmulti-objective scheduling modelimmune balanceselection strategyelite retention strategy
Publication Date：2018-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 55-61 )