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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An optimal algorithm for a two runway scheduling problem


    Contributors:


    Publication date :

    2013-07-01


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    An optimal algorithm for a two runway scheduling problem

    Ravidas, Amrish | Online Contents | 2013


    A Tabu Search Algorithm for the Multiple Runway Aircraft Scheduling Problem

    Soykan, Bulent / Rabadi, Ghaith | Springer Verlag | 2016


    Stochastic Runway Scheduling

    Solak, Senay / Solveling, Gustaf / Clarke, John-Paul B. et al. | British Library Online Contents | 2018


    Time-Indexed Formulations for the Runway Scheduling Problem

    Avella, Pasquale / Boccia, Maurizio / Mannino, Carlo et al. | British Library Online Contents | 2017