Algorithms for Scheduling Runway Operations Under Constrained Position Shifting

The efficient operation of airports, and runways in particular, is critical to the throughput of the air transportation system as a whole. Scheduling arrivals and departures at runways is a complex problem that needs to address diverse and often competing considerations of efficiency, safety, and equity among airlines. One approach to runway scheduling that arises from operational and fairness considerations is that of constrained position shifting (CPS), which requires that an aircraft's position in the optimized sequence not deviate significantly from its position in the first‐come‐first‐served sequence. This paper presents a class of scalable dynamic programming algorithms for runway scheduling under constrained position shifting and other system constraints. The results from a prototype implementation, which is fast enough to be used in real time, are also presented.