Research Article

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

Table 7

Comparison between MOMAD and other algorithms using IGD metric for Kacem and BR data instances.

InstanceAlgorithm
MOMADMOGAPLSHSFLAHMOEASEAP-EDAhDPSOPRMOTS + IS

ka 0.1954
ka 0.25320.2532
ka
ka 0.1250
ka 0.35710.1429
MK010.15250.05250.19090.03000.00780.03070.09840.0042
MK020.06800.06620.14930.01190.03570.01190.0287
MK030.39330.21190.21190.08380.19110.0949
MK040.14700.15080.02710.06170.05400.0340
MK050.02450.24860.02450.02450.05960.0223
MK060.02430.14570.12830.02960.07740.1377
MK070.09240.11740.10290.09240.09760.0841
MK080.17090.15190.15190.05670.0540
MK090.01150.24910.10830.06480.15200.0305
MK100.11110.09020.04190.07620.16530.0517

For each instance, the minimal IGD values obtained by the compared algorithms are marked in bold.