Research Article

A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

Table 4

Comparison results on Liao’s benchmark problems of Case  1.

ProblemPSORKGAIADGSO
AVEMINSTD (s)AVEMINSTD (s)AVEMINSTD (s)AVEMINSTD (s)

j30c5e1511.75072.450.9513.05053.960.4509.05061.553.6503.15011.564.2
j30c5e2670.36700.429.8670.56700.864.9670.06700.044.9670.06700.01.9
j30c5e3663.66573.766.0667.56557.583.4659.66551.775.9654.06511.572.3
j30c5e4631.36282.185.3630.76263.172.4629.26271.280.4622.26211.182.3
j30c5e5668.56661.764.1671.76664.568.5662.86620.470.0662.66620.433.6
j30c5e6675.46703.367.6679.06705.666.3669.16652.562.7663.56612.252.2
j30c5e7686.16841.849.7686.06832.574.2683.96820.954.8681.16810.447.4
j30c5e8737.97323.295.4738.37315.1101.1734.27311.886.3729.87291.164.8
j30c5e9708.87052.089.8709.87035.1103.7705.47021.690.2699.66981.299.7
j30c5e10650.56415.382.2648.86367.284.9642.56372.271.2634.96311.983.0

Average660.46562.668.1661.56554.578.0656.66541.469.0652.16511.160.1