BNMG: A Novel Deterministic Hybrid Algorithm with Global Makespan-Based Swap Mechanism for the Permutation Flow Shop Scheduling Problem
This study proposes a method that aims to enrich the design space of deterministic PFSSP heuristics by introducing two new problem-specific sequence improvement operators inspired by classical sorting principles, and develops a new deterministic hybrid algorithm called BNMG (Bubble–NEH–Merge–Global).