Hybrid decomposition based artificial bee colony algorithm including simulated annealing for multi-objective flexible job shop scheduling problem

This paper presents a novel hybrid metaheuristic combining Artificial Bee Colony (ABC) and Simulated Annealing (SA) to solve the Multi-Objective Flexible Job Shop Scheduling Problem (MO-FJSP). The approach uses a decomposition strategy to transform the multi-objective problem into sub-problems, promoting diverse and well-distributed Pareto solutions. SA is integrated during the onlooker bee phase to enhance local search. The algorithm’s effectiveness is validated through experiments on benchmark instances, showing improved performance compared to existing methods.