Loading...

A new scheduling strategy for aircraft landings under dynamic position shifting

Malaek, S. M. B ; Sharif University of Technology | 2008

390 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AERO.2008.4526378
  3. Publisher: 2008
  4. Abstract:
  5. Optimal scheduling of runway operations plays an important role in improving safety and efficiency of any congested airspace. The objective of scheduling is runway assignment and computing arrival times that minimize delays and maximize runway throughput. Currently, methods for runway scheduling are categorized into First-Come-First-Serve (FCFS) and Constrained Position Shifting (CPS). In this work, we describe a new algorithm for real time scheduling for single as well as multiple parallel runway scheduling. The new approach is comparable to FCFS algorithms in accommodating practical issues while enjoying optimality similar to that of CPS methods. Different case studies show that the new approach could effectively improve a FCFS algorithm by 5 to 16 percent. ©2008 IEEE
  6. Keywords:
  7. Aircraft ; Aircraft landing ; Parallel algorithms ; Scheduling ; Arrival times ; Case studies ; New algorithm ; New approaches ; Optimal scheduling ; Optimality ; Parallel runways ; Position shifting ; Practical issues ; Real-time scheduling ; Runway assignment ; Runway operations ; Scheduling strategies ; Airport runways
  8. Source: 2008 IEEE Aerospace Conference, AC, Big Sky, MT, 1 March 2008 through 8 March 2008 ; 2008 ; 1095323X (ISSN) ; 1424414881 (ISBN); 9781424414888 (ISBN)
  9. URL: https://ieeexplore.ieee.org/abstract/document/4526378