The Application and Research of Flight Scheduling Strategies

Authors

  • Ruowei Ni

DOI:

https://doi.org/10.54097/y6w44r93

Keywords:

Flight Scheduling, Airport Dispatch, First Come First Serve, Small Job First policy, Shortest Remaining Processing Time.

Abstract

The rapid development of the aviation industry has increased the complexity and importance of flight scheduling. This paper studies scheduling policies from both temporal and spatial perspectives. Three standard scheduling policies, First Come First Serve policy (FCFS), Small Job First policy (SJF), and Shortest Remaining Processing Time policy (SRPT), are introduced in a modularized form. In this paper, we explore the roles of the three policies in dealing with different scenarios in the airport scheduling process: FCFS prioritizes task arrival time for normal scheduling, SJF prioritizes task execution time for runway scheduling under the pressure of high throughput and SRPT prioritizes the remaining task execution time to cope with delays promptly. The dynamic system of flight scheduling should be able to cope with a variety of possible situations, combine various modules efficiently and improve them to solve the problems. The research in this paper can provide reference ideas for the design of subsequent dispatch models.

Downloads

Download data is not yet available.

References

[1] Baker,K.R.; Trietsch,D. Principles of Sequencing and Scheduling; John Wiley&Sons: Hoboken,NJ,USA,2013.

[2] Neuman,E;Erzberger,H.Analysis of Sequencing and Scheduling Methods for Arrioal Traffc;NASA Technical Memorandum 102795; NASA Ames Center:Mountain View,CA,USA,1990.

[3] Wu,S.;Liu,X.Optimized sequencing and scheduling algorithms for arrival air traffics based on FCFS principles.IFAC Proc.Vol. 1994,27,215-218.

[4] Meyn,L.A.A Closed-Form Solution to Multi-Point Scheduling Problem.In Proceedings of the AIAA Modeling and Simulation Technologies (MST)Conference,AIAA,Toronto,ON,Canada,2-5 August 2010.

[5] Park,C.; Lee,H.-T; Meyn, LA. Computing Flight Departure Times using an Advanced First-Come First-Served Scheduler. In Proceedings of the 12th AIAA Aviation Technology, Integration and Operations (ATIO)Conference,AIAA,Indianapolis,ID,USA,17-19 September 2012.

[6] Palopo,K; Chatteri,G.B: Lee,H-T. Interaction of Airspace Partitions and Traffic Flow Management Delay In Proceedings of the 10th AIAA Aviation Technology, Integration, and Operations(ATIO)Conference, AIAA, Fort Worth,TX,USA,13-15 September 2010.

[7] Smeltink, JW.; Soomer,MJ.; de Wal,PR.; van der Mei,R.D.An Optimisation Model for Airport Taxi Scheduling. In Proceedings of the INFORMS Annual Meeting,Denver,CO,USA,24-27 October 2004.

[8] Lee,H; Balakrishnan, H. A Comparison of Two Optimization Approaches for Airport Taxiway and Runway Scheduling. In Procedings of the 2012IEEE/AIAA31st Digital Avionics Systems Conference(DASC),Williamsburg,VA,USA,14-18 October 2012.

[9] Bosson,C.S.; Sun,D. Optimization of airport surface operations under uncertainty. J.Air Transp.2016,24,84-92.

[10] Yang,Y; Gao,Z. Stochastic Scheduling of Ground Movement Problem Integrated with Taxiway Routing and Gate/Stand Allocation. IET Intell. Transp.Syst. 2022,16,1143-1163.

[11] Avell,P;Boccia,M.;Mannino,C.;Vasilyey,I Time-Indexed Formulations for the Runway Sheduling Problem.Transp.Sci.2017, 51,1196-1209.

Downloads

Published

26-12-2024