A Hybrid Algorithm for the Permutation Flowshop Scheduling Problem without Intermediate Buffers

Table 2

Comparison results between SSVNS and the other powerful algorithms.

Problem	TS+M		H-EDA		DMS-PSO		SSVNS
	APRD	minPRD	APRD	minPRD	APRD	minPRD	APRD	minPRD
20 × 5	0.34	0.34	−0.43	−0.43	−0.30	−0.36	−0.43	−0.46
20 × 10	−1.77	−1.77	−2.39	−2.39	−2.32	−2.39	−2.38	−2.40
20 × 20	−2.94	−2.94	−3.27	−3.27	−3.26	−3.30	−3.22	−3.30
50 × 5	−0.55	−0.55	−4.00	−4.01	−2.78	−3.12	−4.06	−4.42
50 × 10	−3.52	−3.52	−4.80	−4.80	−3.45	−4.09	−4.85	−5.48
50 × 20	−4.26	−4.26	−4.94	−4.95	−4.91	−5.09	−5.18	−5.53
100 × 5	2.62	2.62	−2.49	−2.49	−1.01	−1.52	−2.32	−2.63
100 × 10	−2.66	−2.66	−5.02	−5.03	−4.43	−4.87	−5.11	−5.76
100 × 20	−3.02	−3.02	−3.85	−3.86	−4.72	−5.14	−4.02	−4.60
200 × 10	−0.58	−0.58	−3.70	−3.70	−1.93	−2.36	−3.10	−4.08
200 × 20	−2.31	−2.31	−3.37	−3.37	−2.94	−3.31	−3.28	−3.90
500 × 20	−1.47	−1.47	−1.89	−1.89	−2.00	−2.28	−1.82	−1.99
Average	−1.68	−1.68	−3.35	−3.35	−2.89	−3.10	−3.31	−3.71