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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An optimal algorithm for a two runway scheduling problem


    Beteiligte:


    Erscheinungsdatum :

    2013-07-01


    Format / Umfang :

    8 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    An optimal algorithm for a two runway scheduling problem

    Ravidas, Amrish | Online Contents | 2013


    Stochastic Runway Scheduling

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



    A dynamic programming algorithm for robust runway scheduling

    Chandran, B. / Balakrishnan, H. | Tema Archiv | 2007


    Optimal mixed-mode runway scheduling — Mixed-integer programming for ATC scheduling

    Helmke, Hartmut / Gluchshenko, Olga / Martin, Alexander et al. | IEEE | 2011