Runway Scheduling with Holding Pattern and Service Priority

Abstract

In this paper, we have studied a scheduling problem associated
with air-traffic control, in which a set of aircrafts are about to land
on a single runway. The objectives are to maximize the minimum
time elapsed between any two consecutive landings, minimize the
107108
maximum number of times a plane enters a holding time, likewise
including the priority of aircraft landings. We use the mixed integer
three dimensional problem formulation that allows us to solve large
instances of the general problem. Our numerical results validated
the effectiveness of the proposed method.