Metaheuristics for Order Scheduling Problem with Unequal Ready Times

Table 2

Computational results of the branch-and-bound method.

n	m	λ	Number of nodes		CPU time (seconds)		FS
			mean	max	mean	max
12	2	0.25	73056.61	2766243	0.717	24.508	100
		0.5	7509.79	329861	0.084	3.401	100
		0.75	1216.78	14199	0.019	0.172	100
	3	0.25	325210.3	5908745	3.926	63.461	100
		0.5	18605.52	386331	0.237	4.898	100
		0.75	3250.92	39243	0.057	0.624	100
	4	0.25	1889929	29703900	26.156	358.132	100
		0.5	36485.91	1125381	0.55	14.758	100
		0.75	5020.36	57669	0.099	0.936	100
14	2	0.25	843689.3	21839448	11.369	277.105	100
		0.5	17778.5	362433	0.267	4.602	100
		0.75	6004.25	73865	0.119	1.154	100
	3	0.25	6090544	69349704	105.13	1209.756	100
		0.5	218458.6	8975480	3.702	149.324	100
		0.75	37785.98	689467	0.778	15.678	100
	4	0.25	33331922	435865824	659.244	8244.48	100
		0.5	204696.6	6275558	4.187	126.234	100
		0.75	55313.7	1829593	1.331	33.812	100
16	2	0.25	3666306	47015688	63.802	780.504	86
		0.5	124890.3	4700103	2.473	87.454	100
		0.75	226230.2	11121498	5.07	251.271	100
	3	0.25	15812686	98160472	271.753	1947.797	64
		0.5	2029674	47596468	40.71	764.967	99
		0.75	792803.5	36248012	22.483	1078.575	100
	4	0.25	11951878	79378032	269.248	1781.984	39
		0.5	2418552	31824482	65.916	959.827	98
		0.75	438707.6	20652540	19.078	921.186	100