An optimal algorithm for a two runway scheduling problem
- Additional Document Info
- View All
This article addresses a two runway, scheduling problem that aims to assign the aircraft to the runways and find an arrival time for each aircraft such that the sum of the delays of all the aircraft is minimized subject to the timing, safety, and chain-type precedence constraints for the aircraft. An optimal algorithm is developed for the two runway, scheduling problem based on generalized dynamic programming. Computational results are presented to show that this algorithm is computationally faster than the existing dynamic programming algorithm for the two runway, scheduling problem. © IMechE 2013.
author list (cited authors)
Ravidas, A., Rathinam, S., & Wood, Z.