A comparison among scheduling algorithms in order to improve the air traffic control

Air travel has increased dramatically and the construction of new airports and runways has not kept pace with the increase in air traffic. The development and the implementation of effective optimization methods for air traffic control requires great attention to scheduling problems. In fact, air traffic controllers can be seen as real-time systems. In this paper the problem of flights scheduling (landings and takeoffs) is addressed. Timeline Scheduling, First Come First Served and Earliest Deadline First algorithms have been compared in order to assess which of the three obtain better performance in the context of optimizing the flights scheduling.