Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

Table 1

The performance of the B&B with 𝑛=12 and 𝜃=0.5.

P	τ	R	Number of nodes		CPU time
			Mean	SD	Mean	SD
0.25	0.25	0.25	275.81	182.83	0.01	0.08
		0.50	389.64	327.66	0.00	0.07
		0.75	496.82	774.90	0.00	0.07
	0.50	0.25	378.42	363.44	0.00	0.06
		0.50	504.80	636.00	0.00	0.07
		0.75	473.48	474.64	0.00	0.06
	0.75	0.25	154.05	169.55	0.00	0.04
		0.5	214.68	244.00	0.00	0.05
0.5	0.25	0.25	323.24	228.37	0.00	0.05
		0.50	345.06	332.54	0.01	0.09
		0.75	362.94	492.78	0.00	0.06
	0.50	0.25	105.47	96.16	0.00	0.03
		0.50	216.62	246.72	0.01	0.08
		0.75	293.75	285.05	0.00	0.06
	0.75	0.25	23.18	35.97	0.00	0.02
		0.5	67.08	105.95	0.00	0.03
0.75	0.25	0.25	115.18	96.11	0.00	0.05
		0.50	160.90	123.03	0.00	0.05
		0.75	104.57	169.79	0.00	0.04
	0.50	0.25	3.95	25.52	0.00	0.03
		0.50	23.55	50.71	0.00	0.02
		0.75	66.48	78.98	0.00	0.03
	0.75	0.25	4.82	20.06	0.00	0.02
		0.5	5.98	29.08	0.00	0.02