Class scheduling for pilot training

Class scheduling for pilot training

0.00 Avg rating0 Votes
Article ID: iaor20073236
Country: United States
Volume: 52
Issue: 1
Start Page Number: 148
End Page Number: 162
Publication Date: Jan 2004
Journal: Operations Research
Authors: , ,
Keywords: transportation: general, education, heuristics, programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.