A Branch-and-Bound Algorithm for Minimizing the Energy Consumption in the PFS Problem

Table 1

Performance test of the proposed algorithm for problems with different sizes, each including 100 randomly generated instances.

Problem size		Node number		CPU time (s)
		Mean	Std	Mean	Std
	𝑚=5	122	170	0.00	0.00
𝑛=8	𝑚=10	203	149	0.00	0.00
	𝑚=20	485	365	0.05	0.03
	𝑚=5	235	425	0.00	0.00
𝑛=9	𝑚=10	642	919	0.01	0.01
	𝑚=20	1552	1246	0.23	0.13
	𝑚=5	687	1418	0.00	0.00
𝑛=10	𝑚=10	1427	2100	0.05	0.06
	𝑚=20	4760	3899	0.86	0.55
	𝑚=5	2818	7495	0.01	0.03
𝑛=11	𝑚=10	4931	16608	0.20	0.56
	𝑚=20	15663	13793	3.40	2.42
	𝑚=5	17828	57474	0.11	0.30
𝑛=12	𝑚=10	11145	19341	0.56	0.82
	𝑚=20	50040	53305	12.91	11.34
	𝑚=5	148403	787570	0.80	3.87
𝑛=13	𝑚=10	75550	292675	3.19	9.63
	𝑚=20	186429	236595	56.09	58.79
	𝑚=5	1831908	7847959	8.95	35.98
𝑛=14	𝑚=10	172948	439658	9.43	19.09
	𝑚=20	513043	642645	186.96	191.61
	𝑚=5	9165825	37677728	47.76	193.38
𝑛=15	𝑚=10	1374782	5754004	71.97	274.53
	𝑚=20	2748107	10862267	991.37	2540.82