Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem

Table 4

Comparison between CPLEX and Lagrangian relaxation for small instances.

Problem			Avg. rel. dev. (%)		Avg. CPU time (s)
|N|	|M|	T	OBJ_Dev	LR_Gap	CPLEX	LR
10	3	360	0.13	2.59	0.45	4.33
12	5	360	0.32	3.37	38.48	16.04
14	5	360	1.31	3.96	176.43	45.18
16	5	360	1.38	4.42	271.38^{4}	81.85
18	5	360	1.76	5.24	288.37^{4}	90.28
20	5	360	2.01	5.43	158.28^{2}	72.62

^{•}The number of instances not optimally solved in 600 s, and CPU time is set to 600 s.