Research Article

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

Table 5

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

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

j30c5e1561.65575.180.2562.15558.7107.0559.65542.487.0552.75492.747.1
j30c5e2720.07014.486.8723.87017.8102.3716.37013.297.7700.76972.7111.6
j30c5e3747.57396.069.6748.67356.289.0743.07364.577.4723.37124.656.9
j30c5e4702.26967.5101.9701.36948.1121.6697.56885.969.7685.36745.972.0
j30c5e5733.77268.754.3734.172613.5105.3731.57265.954.2725.17093.816.2
j30c5e6737.17303.6114.4737.07206.071.8730.77183.1101.8718.17088.8124.8
j30c5e7752.27454.391.7751.87436.9110.1747.97413.884.9732.17234.7103.9
j30c5e8836.780210.496.8839.279214.984.6826.47909.583.4786.87716.790.0
j30c5e9799.47916.898.2800.278915.4107.3793.67885.9106.5766.97604.8101.6
j30c5e10748.97403.288.7746.271511.6108.8738.17129.393.5718.57108.777.6

Average733.97236.088.3734.47179.9100.8728.57155.485.6710.97015.380.2