The aircraft runway scheduling problem: A survey

The aircraft scheduling problem consists in sequencing on airport runways and their times of operations taking into consideration several operational constraints. It is known to be an NP-hard problem, ongoing challenge for both researchers air traffic controllers. aim this paper present a focused review the most relevant techniques recent literature (since 2010) runway including exact approaches such as mixed-integer programming dynamic programming, metaheuristics, novel based reinforcement learning. Since benchmark instances used are easily solved by high-performance computers current versions solvers, we propose new data set with challenging realistic problems constructed from real-world traffic.