SCHEDULING OF AIRLINE FLIGHT CREWS

An approach to the problem of scheduling airline flight crews is presented and illustrated by an example. The problem is considered to be composed of two distinct parts, that of selecting the sequence of flights to be taken by a particular crew, and that of allotting these sequences to individual crews so as to minimize costs. Linear integer programming is used to cast the crew assignment phase into the form of a fixed-charge problem. Although the problem may be formulated quite readily so as to obtain an optimal solution, computational difficulties will limit the size of a practical problem that can be solved in this manner. The choosing of the optimal sequence of flights is formulated as a traveling salesman problem and as a network flow problem. Individual ''tours'' will be selected so that ground time costs and overnighting expenses that are incurred when at a station other than the home base will be minimized. Within certain limitation, it is shown that an optimal set of tours can be generated.

  • Corporate Authors:

    Massachusetts Institute of Technology

    Department of Aeronautics and Astronautics, 77 Massachusetts Avenue
    Cambridge, MA  United States  02139
  • Authors:
    • Moreland, J A
  • Publication Date: 1966-8-22

Subject/Index Terms

Filing Info

  • Accession Number: 00074538
  • 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