An optimal algorithm for a two runway scheduling problem Academic Article

abstract

• 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.

authors

• Rathinam, Sivakumar

published proceedings

• PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING

author list (cited authors)

• Ravidas, A., Rathinam, S., & Wood, Z.

citation count

• 7

complete list of authors

• Ravidas, Amrish||Rathinam, Sivakumar||Wood, Zachary

publication date

• July 2013

publisher

• SAGE Publications  Publisher

keywords

• Aircraft Scheduling
• Airports
• Dynamic Programming

Digital Object Identifier (DOI)

• 10.1177/0954410012450546

start page

• 1122

end page

• 1129

volume

• 227

issue

• 7

URL

• http://dx.doi.org/10.1177/0954410012450546