DefinePK

Abstract

Historically, the Aircraft Landing Scheduling (ALS) problem remains one of the complex problems in the air traffic management domain. In the last years the number of air traffic increases on almost all airport platforms in the world, so the aircraft landing scheduling optimization become a critical problem. In the practice the ALS problem can be considered as an optimization problem under constraints and that requires real-time approach to solve it. Several methods of optimizing the landing cost of a sequence of aircraft have been proposed, such as methods using the approach of linear programming and other optimization methods based on meta-heuristics algorithms. These methods have shown great advantage over the method first-come-first served (FCFS) currently used for air traffic management. In this paper, we propose a method that optimizes the aircraft landing scheduling problem based on real time scheduling algorithm Deadline Monotonic (DM). This approach solves the ALS problem in two steps. First, it gives a mathematical model of aircraft landing scheduling problem, thereafter in the second step, our approach schedules.