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

Table 2

Results of Car's instances for makespan minimization and energy consumption minimization.

Instance	Problem size	𝐹|𝑝𝑟𝑚𝑢|𝐶max		𝐹|𝑝𝑟𝑚𝑢|𝑊
	(𝑚×𝑛)	𝐶^∗max	𝑊	𝐶max	𝑊^∗
CAR1	5×11	7038	4135	8263	415
CAR2	4×13	7166	2524	9163	0
CAR3	5×12	7312	3684	9010	61
CAR4	4×14	8003	2272	8952	222
CAR5	6×10	7720	6979	8803	2148
CAR6	9×8	8505	8411	9814	5493
CAR7	7×7	6590	3496	7264	1089
CAR8	8×8	8366	8251	9082	6433