The aircraft scheduling problem consists in sequencing aircraft on airport runways and in scheduling their times of operations taking into consideration several operational constraints. It is known to be an NP-hard problem, an ongoing challenge for both researchers and air traffic controllers. The aim of this paper is to present a focused review on the most relevant techniques in the recent literature (since 2010) on the aircraft runway scheduling problem, including exact approaches such as mixed-integer programming and dynamic programming, metaheuristics, and novel approaches based on reinforcement learning. Since the benchmark instances used in the literature are easily solved by high-performance computers and current versions of solvers, we propose a new data set with challenging realistic problems constructed from real-world air traffic.
For more details about this problem visit: https://www.researchgate.net/publication/351012320_The_aircraft_runway_scheduling_problem_A_survey
In my DSA class I Learnt how to solve this problem using Binary Search Trees(BST) and Hash Table(min,max). The time complexity using the BST was linear and corresponded to the height of the tree. The major problem statements discussed in class were:
- Design an algorithm to schedule airplane landings where there is atleast a 30 second gap between consective landings. 2)Tell about landing information from a pre-scheduled landing algorithm
NOTE: This is just my interpretation of the problem post the class and i might have not done justice to thee question and there can be errors in the information. If you have also attended the class feel free to change the details and send in a PR.