The Application and Research of Flight Scheduling Strategies

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.