Research Article

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

Table 4

Comparison of three different aggregation functions on average C value over 10 independent runs for all 15 problems.

InstanceMOMAD(A) versus MOMAD-WS(B)MOMAD(A) versus MOMAD-PBI(C)

ka 0.00000.00000.00000.0000
ka 0.02500.00000.09830.0333
ka 0.10000.00000.11670.0333
ka 0.05830.06670.02500.0333
ka 0.31670.20000.25000.2500
MK010.20700.22210.43860.0373
MK020.22960.12610.61800.1143
MK030.20340.04530.50690.0121
MK040.16890.18680.34570.0704
MK050.17270.13000.56580.0174
MK060.51580.37650.35460.2746
MK070.32940.16900.54080.1346
MK080.01430.00000.33000.0000
MK090.59970.29370.59150.1200
MK100.54080.16370.27950.3700