Multi-Objective Flexible Job Shop Scheduling Problem Based on Non-Dominated Genetic Algorithm

Aiming at the limitation of flexible job shop scheduling (JSP), a multi-objective optimization model of JSP is constructed, which takes the maximum completion time and delivery time as the objective function. Considering the actual inventory size of job shop, a non dominated genetic algorithm is proposed. Combined with the actual inventory and demand, the program is developed to verify the feasibility and effectiveness of the algorithm. The results show that the algorithm can meet the delivery time and the maximum completion time at the same time, considering the size of inventory and achieve satisfactory results.