Heuristic and exact algorithms for scheduling aircraft landings

The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs of planes (not just successive ones) are satisfied. Each plane has an allowable time window as well as a target time. There are costs associated with landing either earlier or later than this target landing time. In this paper, we present a specialized simplex algorithm which evaluates the landing times very rapidly, based on some partial ordering information. This method is then used in a problem space search heuristic as well as a branch-and-bound method for both singleand multiple-runway problems. The effectiveness of our algorithms is tested using some standard test problems from the literature. © 1999 John Wiley & Sons, Inc. Networks 34: 229–241, 1999

[1]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

[2]  David Abramson,et al.  Computing optimal schedules for landing aircraft , 1993 .

[3]  Robert H. Storer,et al.  Local Search in Problem and Heuristic Space for Job Shop Scheduling Genetic Algorithms , 1992 .

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

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

[6]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .

[7]  Andreas Drexl,et al.  A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups , 1995, INFORMS J. Comput..

[8]  H.-G. Nuesser,et al.  Advanced Technologies for Air Traffic Flow Management. , 1994 .

[9]  Lucio Bianco,et al.  A Simulation Model for Aircraft Sequencing in the Near Terminal Area , 1978 .

[10]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

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

[12]  L. Bianco,et al.  An algorithm for optimal sequencing of aircraft in the near terminal area , 1978 .

[13]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[14]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

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

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

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

[18]  Robert H. Storer,et al.  Problem space search algorithms for resource-constrained project scheduling , 1997, Ann. Oper. Res..

[19]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

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

[21]  Robert H. Storer,et al.  Problem space local search for number partitioning , 1996, Ann. Oper. Res..

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

[23]  Lucio Bianco,et al.  Large Scale Computation and Information Processing in Air Traffic Control , 1993 .

[24]  Antonio Sassano,et al.  A Combinatorial Optimization Approach to Aircraft Sequencing Problem , 1987 .

[25]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[26]  Keah Choon Tan,et al.  Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach , 1997 .

[27]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..