By Topic

Polynomial-Time Feasibility Condition for Multiclass Aircraft Sequencing on a Single-Runway Airport

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dimitri Harikiopoulo ; Department of Aeronautics and Aerospace, University of Illinois at Urbana-Champaign , Urbana, IL, USA ; Natasha Neogi

In this paper, we consider the airport-landing problem of scheduling different types of aircraft on a single runway. Since the minimum allowable landing separation time between two consecutive aircraft depends on the relative weight of both aircraft, this is a state-dependent scheduling problem, which, in the general case, is NP-hard. We attempt to modify the aircraft landing sequence from the traditionally used “first-come-first-served” (FCFS) order to be able to land more aircraft in a given period of time. Given a set of planes, the goal is to find a sequence such that no plane can land before it is actually available for landing, the minimum safety separation between two consecutive planes is always satisfied, and the total landing time (makespan) is minimized. Based on the Federal Aviation Administration (FAA) partition of aircraft into weight categories, our algorithm provides a polynomial-time feasibility condition for scheduling a set of planes in a given time interval. It ensures that the Aircraft Scheduling Problem (ASP) presented earlier is not NP-complete and allows us to develop possible practical real-time air traffic control (ATC) execution policies.

Published in:

IEEE Transactions on Intelligent Transportation Systems  (Volume:12 ,  Issue: 1 )