A New Scheduling Strategy for Aircraft Landings under Dynamic Position Shifting

Optimal scheduling of runway operations plays an important role in improving safety and efficiency of any congested airspace. The objective of scheduling is runway assignment and computing arrival times that minimize delays and maximize runway throughput. Currently, methods for runway scheduling are categorized into first-come-first-serve (FCFS) and constrained position shifting (CPS). In this work, we describe a new algorithm for real time scheduling for single as well as multiple parallel runway scheduling. The new approach is comparable to FCFS algorithms in accommodating practical issues while enjoying optimality similar to that of CPS methods. Different case studies show that the new approach could effectively improve a FCFS algorithm by 5 to 16 percent.