Skip to content
Open access

A Load-Aware NSGA-II with Hybrid Initialization and Closed-Loop Adaptive Operator Selection for Multiobjective Flexible Job Shop Scheduling

Nov 2026 · Electronics · 0 citations

Abstract

The multiobjective flexible job shop scheduling problem (MOFJSP) seeks to jointly minimize makespan and maximum machine workload under coupled opera-tion-sequencing and machine-assignment decisions. Although the nondominated sorting genetic algorithm II (NSGA-II) is widely used for the MOFJSP, its performance can be constrained by imbalanced machine workloads, low-quality initial populations, and limited adaptation to evolving population states. This study develops a Hy-brid-Initialized Load-Aware Adaptive NSGA-II (HLA-NSGA-II) that integrates load-aware generation of machine-assignment vectors, dynamic bottleneck-aware hy-brid initialization, and multi-operator neighborhood search with closed-loop adaptive operator selection. These mechanisms respectively incorporate current workloads into machine assignment, prioritize jobs according to the evolving partial schedule, and update neighborhood-operator selection probabilities using relative hypervolume im-provement, objective-space diversity, and search stagnation. Experiments on the Ka-cem and Brandimarte benchmark sets show that the best solutions obtained by HLA-NSGA-II attain the known makespan lower bounds on all four Kacem instances. On the ten Brandimarte instances, HLA-NSGA-II achieves the lowest mean makespan on nine and the lowest or tied-lowest mean maximum machine workload on seven. Ablation studies further support the effectiveness of the proposed mechanisms. Over-all, HLA-NSGA-II achieved competitive performance on the tested instances, with workload outcomes varying across instances and higher computational cost than HSGA. This reflects the trade-off between solution quality and computational cost.

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.