A Scheduling Problem in the Baking Industry

Table 3

Comparison of results.

Problem	Greedy heuristic		AG06		AG16		AG17		ILP
	FO	Time (s)	FO	Time (s)	FO	Time (s)	FO	Time (s)	FO	Best bound	Time (s)
AE1	12,733	<0.001	19,259	1.22	19,227	2.76	20,354	10.25	6,904	22,750	723.8
AE2	56,077	<0.001	54,127	9.49	54,778	20.59	59,823	20.57	54,324	60,567	1134.5
AE3	120,162	0.004	115,224	9.59	108,431	46.94	117,770	41.50	—	—	—
AE4	234,464	0.005	379,281	10.93	376,080	51.07	394,101	55.73	—	—	—
AE5	417,773	0.005	494,619	11.32	491,676	51.31	22,750	57.56	—	—	—
AE6	1,044,610	0.006	1,042,940	14.85	1,151,700	55.98	1,151,920	59.75	—	—	—
AE7	1,141,410	0.006	1,237,610	18.45	1,177,440	58.86	1,235,990	62.41	—	—	—
AE8	1,174,730	0.007	1,247,800	18.74	1,180,000	67.64	1,250,010	92.64	—	—	—