Latest revision as of 23:37, 28 January 2021

Abstract

ve runway scheduling involves scheduling departures for takeoffs and arrivals for runway crossing subject to numerous constraints. This paper evaluates the effect of uncertainty on a deterministic runway scheduler. The evaluation is done against a firstcome-first-serve scheme. In particular, the sequence from a deterministic scheduler is frozen and the times adjusted to satisfy all separation criteria; this approach is tested against FCFS. The comparison is done for both system performance (throughput and system delay) and predictability, and varying levels of congestion are considered. The modeling of uncertainty is done in two ways: as equal uncertainty in availability at the runway as for all aircraft, and as increasing uncertainty for later aircraft. Results indicate that the deterministic approach consistently performs better than first-come-first-serve in both system performance and predictability.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.2514/6.2011-6924

• http://www.aviationsystemsdivision.arc.nasa.gov/publications/2011/AIAA-2011-6924-TN3074.pdf

• http://arc.aiaa.org/doi/pdf/10.2514/6.2011-6924,

http://dx.doi.org/10.2514/6.2011-6924

• https://www.aviationsystemsdivision.arc.nasa.gov/publications/2011/AIAA-2011-6924-TN3074.pdf,

https://www.aviationsystems.arc.nasa.gov/publications/2011/AIAA-2011-6924-TN3074.pdf,

https://ntrs.nasa.gov/search.jsp?R=20120004194,

https://arc.aiaa.org/doi/pdf/10.2514/6.2011-6924,

http://www.aviationsystemsdivision.arc.nasa.gov/publications/2011/AIAA-2011-6924-TN3074.pdf,

https://repository.exst.jaxa.jp/dspace/handle/a-is/266770,

https://academic.microsoft.com/#/detail/2089311258