NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Analysis of sequencing and scheduling methods for arrival trafficThe 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.
Document ID
19900014057
Acquisition Source
Legacy CDMS
Document Type
Technical Memorandum (TM)
Authors
Neuman, Frank (NASA Ames Research Center Moffett Field, CA, United States)
Erzberger, Heinz (NASA Ames Research Center Moffett Field, CA, United States)
Date Acquired
September 6, 2013
Publication Date
April 1, 1990
Subject Category
Air Transportation And Safety
Report/Patent Number
NASA-TM-102795
NAS 1.15:102795
A-90086
Accession Number
90N23373
Funding Number(s)
PROJECT: RTOP 505-67-21
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available