Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem

Chinese Journal of Mechanical Engineering

Table 3 The comparison with other local search algorithms

Instance	Size	i-TSAB	TS/SA		TS/PR		IEBO		TS(NNS)
Instance	Size	MRE_av	MRE_b	MRE_av	MRE_b	MRE_av	MRE_b	MRE_av	MRE_av	MRE_av
TA01-TA10	15×15	0.00	0.01	0.11	0.01	0.01	0.00	0.01	0.01	0.07
TA11-TA20	20×15	0.22	0.25	0.79	0.14	0.38	0.14	0.22	0.16	0.49
TA21-TA30	20×20	1.98	1.97	2.49	1.98	2.19	1.88	2.01	1.99	2.39
TA31-TA40	30×15	0.34	0.37	0.75	0.22	0.40	0.25	0.38	0.58	0.73
TA41-TA50	30×20	3.22	3.17	3.93	2.84	3.34	2.90	3.30	3.68	3.93
SVW01-05	20×10	–	0.17	1.14	0.10	0.23	0.11	0.35	0.27	0.35
SVW06-10	20×15	–	4.25	5.95	3.79	4.33	3.74	4.34	4.29	4.39
YN1-4	20×20	–	3.98	4.51	3.87	4.10	3.87	4.02	4.23	4.50