Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect

Table 1

Computational results of the branch-and-bound method.

	a	Branch and Bound method
		Number of nodes		CPU time (sec.)		Number of Feasible Solutions
		mean	max	mean	max
8		28960.00	28960	0.35	0.41	100
		28960.67	28964	0.35	0.39	100
		28960.69	28966	0.35	0.41	100
9		260649.00	260649	3.63	3.76	100
		260650.20	260661	3.64	3.78	100
		260650.01	260654	3.62	3.73	100
10		2606502.00	2606523	47.08	48.92	100
		2606502.00	2606518	46.93	48.69	100
		2606503.00	2606561	30.56	33.18	100
11		28671517.06	28671719	422.13	485.43	100
		28671513.38	28671543	529.33	593.48	100
		28671513.06	28671530	529.24	593.19	100