We provide a justification for maximizing the number ofīalanced chains (flight sequences with the same start and end terminals). Here we discuss the revival of this method and its crucial use to construct the so-called chainĭecomposition of the schedule for a single period. Although the initial application ofĭFs was to the Russian AEROFLOT fleet it has subsequently attracted more attention on bus scheduling thanĪircraft scheduling. DF theory was developed in theġ960–70s by Linis and Maksim (1967) and Gertsbakh and Gurevich (1977). Which changes by+1 and−1 at flight departure and arrival times, respectively. A DF is a step function associated with an aircraft terminal On a DF representation of an aircraft flight schedule. This is achieved by using the fleet size theorem based Number of aircraft needed to carry out the flight schedule. The initial step in our approach is to find the minimal Each chain visits periodically a set of airports and is served by severalĬockpit crews circulating along the airports of this set. We use deficit functions (DF) to decompose an aviation schedule of aircraft flights into aircraft chains We consider the problem of minimizing the number of airplanes needed to fly a fixed daily repeating schedule ofįlights.
0 kommentar(er)
