Greedy algorithm for the scheduling aircrafts landings

In this study, we consider the aircraft landing scheduling problem (ALS). It is well-known NP-hard problem. This is an indicator that the optimal solution cannot be found at real time. We recommend a greedy algorithm for the solution of problem in this paper. For simplicity, this algorithm that is told for static ALS problem may also be generalized for dynamic ALS problems. It has been shown on a simple example that the Greedy algorithm may not provide the optimal solution. Despite of it, if we don´t aim to find the best solution but better solution, then it is found that the Greedy algorithm is faster than other approximate solution algorithms.