A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.
Automated aircraft scheduling methods in the near terminal area.
American Institute of Aeronautics and Astronautics, Aerospace Sciences Meeting ; 1972 ; San Diego, CA
1972-01-01
Conference paper
No indication
English
The dynamic scheduling of aircraft in the near terminal area
Elsevier | 1978
The Dynamic scheduling of aircraft in the near terminal area
TIBKAT | 1976
|The dynamic scheduling of aircraft in the near terminal area
Elsevier | 1978