A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop

Table 2

The performance of the B&B algorithm according to RDD and TF under n = 9 and m = 2.

RDD	TF	Computational time		The number of nodes
		Average	Max	Average	Max
0.2	0.2	0.029	0.175	11626.45	36520
	0.5	0.028	0.071	4143.25	12049
	0.8	0.039	0.15	5650.75	23505
0.5	0.2	0.049	0.179	9536.7	34911
	0.5	0.045	0.122	7760.05	23526
	0.8	0.051	0.146	8294.2	23623
0.8	0.2	0.031	0.127	5547.8	21737
	0.5	0.061	0.164	11497.05	28191
	0.8	0.076	0.205	14115.05	39096