An improved adaptive NSGA-II for multi-objective comprehensive scheduling problem of Flexible Assembly Job Shop

This paper investigates the comprehensive scheduling problem in Flexible Assembly Job Shop (FAJSP), aiming to simultaneously manage both the processing and assembly activities of workpieces to minimize tardiness and machine energy consumption. To achieve this, a mathematical model for the FAJSP is established, and an improved adaptive NSGA-II algorithm (IA-NSGA-II) is introduced. This algorithm utilizes a process constraint matrix encoding to satisfy assembly constraints and adjusts crossover and mutation operations to ensure chromosome validity. Additionally, variable neighborhood search method (VNS) is employed to expand the search space and generate higher-quality solutions. Simulation experiments confirm the effectiveness of the proposed algorithm in addressing FAJSP.