AN ALGORITHM FOR AIRCRAFT SCHEDULING IN A RADIAL NETWORK

This paper deals with the aircraft scheduling problems of an airline with a radial network. Within such a network it is relatively easy to determine whether or not a newly suggested time table for a given tupe of aircraft can be implemented with the available fleet, but it is not so easy to see the possibilities for maintenance, instruction flights etc., which the time table offers. Moreover, one has to cope with the constraint, that specific flights are committed to only one of the subtypes of a given aircraft type. This means that the flights have to be grouped and that each group of flights must be assigned to the fleet of one of the subtypes. In practice, there are many feasible solutions and this report suggests a method to generate those solutions, starting from the draft time table. This method, based on a branch and bound algorithm is also applicable to the solution of other problems. As an illustration the daily pairing phase of the European crew scheduling problem is discussed in the last chapter.

  • Corporate Authors:

    Euromoney Publications

    Nestor House, 4 Playhouse Yard
    London,   United Kingdom  EC4V 5EX
  • Authors:
    • Te Winkel, D
  • Publication Date: 1969-10-19

Subject/Index Terms

  • TRT Terms: Airlines
  • Subject Areas: Aviation;

Filing Info

  • Accession Number: 00074542
  • Record Type: Publication
  • Source Agency: FLIGHT TRANSPORTATION LABORATORY, MIT DEPT. OF AERONAUTICS AND ASTRONAUTICS
  • Report/Paper Numbers: None
  • Files: TRIS
  • Created Date: Sep 5 1974 12:00AM