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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways


    Contributors:

    Published in:

    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    C.A.B. safety bulletin discusses take-offs following forced landings

    Troshkin, A.N. | Engineering Index Backfile | 1941



    Algorithms for Scheduling Aircraft Landings

    Ernst, A. T. / Krishnamoorthy, M. / International Federation of Operational Research Societies | British Library Conference Proceedings | 2001


    Scheduling Aircraft Landings - The Static Case

    Beasley, J.E. | Online Contents | 2000