Research on Many-Objective Flexible Job Shop Intelligent Scheduling Problem Based on Improved NSGA-III

Abstract

With the development of intelligent manufacturing and the customized product demand of customers, manufacturing enterprises are urgently required to carry out high-efficiency, high-quality, flexibility and low-cost manufacturing to enhance the competitiveness of enterprises. Intelligent job shop scheduling problem is the core decision of intelligent manufacturing production management. Many-objective job shop scheduling algorithms can effectively solve this problem. However, existing optimization algorithms cannot effectively solve many-objective flexible job shop scheduling problem. This paper establishes the many-objective job shop intelligent scheduling model with complex constraints, and proposes an improved intelligent decision optimization algorithm named NSGA-III-APEV based on NSGA-III. This algorithm uses the penalty-based boundary intersection distance that takes into account both convergence and diversity simultaneously to define the distance between the population individual and the reference vector in the association operation. This paper exploits the penalty-based boundary intersection distance-based elimination mechanism to preserve individuals and reduce the computational cost in the individual preservation strategy. Meanwhile, the adaptive mutation strategy based on consanguinity is employed in genetic operators. The presented method effectively improves the convergence and diversity of the population. Finally, NSGA-III-APEV with other algorithms was compared through benchmarks. Experimental results demonstrated the effectiveness and superiority of the improved method. The feasibility of the improved method in solving the many-objective flexible job shop scheduling problem are verified by engineering examples.

Keywords

• Adaptive mutation strategy
• elimination mechanism
• many-objective flexible job shop scheduling problem
• many-objective optimization
• NSGA-III