A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem

<div>Ranking in the average performance score over MK01, MK02, MK03, and MK08 problem instances for the compared nine algorithms and over other six BRdata instances for the compared seven algorithms. The smaller the score, the better the overall performance in terms of HV and IGD metrics.</div>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem 