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

Chinese Journal of Mechanical Engineering

Table 1 The comparison of the number of neighbourhood solutions and the time spent

Instance	Size	N5		N6		N7		NNS
Instance	Size	s_num	T	s_num	T	s_num	T	s_num	T1	T2
LA01-05	10×5	1.00	1.00	3.24	1.82	5.67	3.03	10.83	5.55	4.46
LA06-10	15×5	1.00	1.00	5.03	3.59	14.63	6.69	30.41	13.15	11.07
LA11-15	20×5	1.00	1.00	8.27	3.97	20.01	7.13	40.90	13.33	11.25
LA16-20	10×10	1.00	1.00	1.70	1.23	2.30	1.46	4.17	2.83	2.16
LA21-25	15×10	1.00	1.00	2.29	1.30	3.59	1.81	7.63	4.58	3.29
LA26-30	20×10	1.00	1.00	3.26	1.76	6.26	2.62	14.98	7.28	4.75
LA31-35	30×10	1.00	1.00	5.60	2.50	17.09	4.89	40.67	17.07	9.35
LA35-40	15×15	1.00	1.00	1.53	1.16	2.22	1.42	4.55	4.20	2.37
TA01-10	15×15	1.00	1.00	1.48	1.21	1.88	1.43	3.37	4.20	2.38
TA11-20	20×15	1.00	1.00	1.56	1.27	2.15	1.60	4.35	6.29	3.10
TA21-30	20×20	1.00	1.00	1.43	1.21	1.79	1.43	3.44	7.86	2.55
TA31-40	30×15	1.00	1.00	1.70	1.33	2.50	1.74	5.59	13.15	4.09
TA41-50	30×20	1.00	1.00	1.53	1.27	2.11	1.59	4.73	13.56	3.50
TA51-60	50×15	1.00	1.00	3.14	2.04	7.26	3.28	14.74	33.50	7.88
TA61-70	50×20	1.00	1.00	1.75	1.41	2.12	1.91	7.33	35.42	4.85
TA71-80	100×20	1.00	1.00	4.72	1.76	11.21	1.95	23.81	208.54	6.51