Class Scheduling for Pilot Training

Xiangtong Qi (), Jonathan F. Bard () and Gang Yu ()
Additional contact information
Xiangtong Qi: Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Jonathan F. Bard: Graduate Program in Operations Research, Department of Mechanical Engineering, The University of Texas, Austin, Texas 78712-1063
Gang Yu: Department of Management Science and Information Systems, Red McCombs School of Business, The University of Texas, Austin, Texas 78712

Operations Research, 2004, vol. 52, issue 1, 148-162

Abstract: In this paper, we study the class scheduling problem at the training center of Continental Airlines. When pilots get new assignments, they must be retrained for up to eight consecutive weeks. During that time, they are removed from the roster, and thus impose a significant cost on the airlines. We formulate the problem with the objective of minimizing the total weighted length of all classes. Solutions are obtained with a branch-and-bound algorithm and a family of heuristics based on the idea of a rolling horizon. A series of computational experiments is performed to evaluate the algorithms. The results indicate that it is possible to obtain near-optimal solutions within acceptable time limits. The algorithms have been implemented and are now in use at Continental.

Keywords: Transportation/scheduling/personnel: class scheduling; Programming/algorithms: branch-and-bound; heuristics; rolling horizon (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1030.0076 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:52:y:2004:i:1:p:148-162

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().