This paper presents an optimization method for the aircraft scheduling problem with general runway configurations. Take-offs and landings have to be assigned to a runway and a time while meeting the sequence-dependent separation requirements and minimizing the costs incurred by delays. Some runways can be used only for take-offs, landings, or certain types of aircraft while schedules for interdependent runways have to consider additional diagonal separation constraints. Our dynamic programming approach solves realistic problem instances to optimality within short computation times. In addition, we propose a rolling planning horizon heuristic for large instances that returns close-to-optimal results.
Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways
Transportation research / E ; 88 ; 167-188
2016
Aufsatz (Zeitschrift)
Englisch
C.A.B. safety bulletin discusses take-offs following forced landings
Engineering Index Backfile | 1941
|Simulated landings, take-offs in fog made by Lieut. Doolittle
Engineering Index Backfile | 1929
Algorithms for Scheduling Aircraft Landings
British Library Conference Proceedings | 2001
|Scheduling Aircraft Landings - The Static Case
Online Contents | 2000
|Fatiguing effect of multiple take-offs and landings in regional airline operations
Online Contents | 2016
|