A Multi-objective Hyper-Heuristic for the Flexible Job Shop Scheduling Problem with Additional Constraints

This paper proposes a multi-objective hyperheuristic (MOO-HMHH) algorithm for the flexible job shop scheduling problem (FJSP) with sequence-dependent set-up times, auxiliary resources and machine down time. Two variations of the algorithm were implemented and evaluated on real customer datasets. The hyper-heuristic algorithms compared well to their constituent algorithms and promising results were obtained with respect to the increased generality of the hyperheuristics.