The aircraft scheduling problem (ASP) is the real-time problem of scheduling takeoff and landing operations at a congested airport in a given time horizon, taking into account the runways and the air segments in the terminal maneuvering area . The ASP can be viewed as a job shop scheduling problem with additional real-world constraints. Compared with the current literature based on job shop scheduling applied to solve the ASP, we enrich the existing models by including new formulations of relevant practical constraints. We introduce and analyze three alternative ASP formulations, in which the objective function is the minimization of delay propagation with respect to the off-line timetable. Scheduling rules, heuristic and exact methods are implemented and tested on instances from the Roma Fiumicino airport, in Italy. Computational experiments show that practical-size instances are solved to near-optimality by our branch and bound algorithm in a few seconds of computation.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Real-time scheduling of aircraft arrivals and departures in a terminal maneuvering area


    Contributors:

    Published in:

    Networks ; 65 , 3 ; 212-227


    Publication date :

    2015


    Size :

    16 Seiten




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Integrated Scheduling Model for Arrivals and Departures in Metroplex Terminal Area

    Li, Tonghe / Liu, Jixin / Jiang, Hao et al. | AIAA | 2025

    Free access

    Arrivals and departures

    Emerald Group Publishing | 1998



    Optimal Integration of Departures and Arrivals in Terminal Airspace

    Xue, M. / Cruz, S. / Zelinski, S. et al. | British Library Conference Proceedings | 2012