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

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.

[1]  G. Rinaldi,et al.  Scheduling tasks with sequence-dependent processing times , 1988 .

[2]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[3]  Yosef S. Sherif,et al.  AN ALGORITHM FOR COMPUTER ASSISTED SEQUENCING AND SCHEDULING OF TERMINAL AREA OPERATIONS , 1991 .

[4]  Tom Reynolds,et al.  Airport systems planning, design, and management , 2003 .

[5]  Chi-Sheng Shih,et al.  State-dependent deadline scheduling , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Alexandre M. Bayen,et al.  MILP formulation and polynomial time algorithm for an aircraft scheduling problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  Janić Milan,et al.  The flow management problem in air traffic control: a model of assigning priorities for landings at a congested airport , 1997 .

[9]  John-Paul Clarke,et al.  Runway operations planning: a two-stage solution methodology , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[10]  Lucio Bianco,et al.  Scheduling Models and Algorithms for TMA Traffic Management , 1997 .

[11]  Cheng-Lung Wu,et al.  Research review of air traffic management , 2002 .

[12]  Amedeo R. Odoni,et al.  Landings at Logan Airport: Describing and Increasing Airport Capacity , 1993, Transp. Sci..

[13]  Lucio Bianco,et al.  Minimizing total completion time subject to release dates and sequence‐dependentprocessing times , 1999, Ann. Oper. Res..

[14]  R de Neufville,et al.  AIRPORT SYSTEMS PLANNING , 1976 .

[15]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[16]  Lucio Bianco,et al.  Coordination of Traffic Flows in the TMA , 2001 .

[17]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

[18]  Roger George Dear.  The dynamic scheduling of aircraft in the near terminal area , 1976 .

[19]  John-Paul Clarke,et al.  Runway Operations Planning and Control: Sequencing and Scheduling , 2001 .

[20]  David Abramson,et al.  Scheduling Aircraft Landings - The Static Case , 2000, Transp. Sci..

[21]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[22]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[23]  Harilaos N. Psaraftis,et al.  A Dynamic Programming approach to the Aircraft Sequencing problem , 1978 .