The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Analysis of sequencing and scheduling methods for arrival traffic


    Contributors:

    Publication date :

    1990-04-01


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English






    Delay Exchanges in Arrival Sequencing and Scheduling

    Gregory C. Carr / Heinz Erzberger / Frank Neuman | AIAA | 1999


    Delay Exchanges in Arrival Sequencing and Scheduling

    Carr, G. / Erzberger, H. / Neuman, F. et al. | British Library Conference Proceedings | 1998