Class Scheduling for Pilot Training

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.

[1]  Jeffery L. Kennington,et al.  Class scheduling algorithms for Navy training schools , 1998 .

[2]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[3]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[4]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[5]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[6]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[7]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[8]  Ellis L. Johnson,et al.  A Global Approach to Crew-Pairing Optimization , 1992, IBM Syst. J..

[9]  Gang Yu,et al.  MOVING TOWARD AN INTEGRATED DECISION SUPPORT SYSTEM FOR MANPOWER PLANNING AT CONTINENTAL AIRLINES: OPTIMIZATION OF PILOT TRAINING ASSIGNMENTS , 1998 .

[10]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[11]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[12]  Safaai Deris,et al.  Timetable planning using the constraint-based reasoning , 2000, Comput. Oper. Res..

[13]  Benjamin G. Thengvall,et al.  OPTIMIZATION-BASED INTEGRATED MANPOWER MANAGEMENT FOR AIRLINES , 2003 .

[14]  Chung-lun Li,et al.  Scheduling with multiple-job-on-one-processor pattern , 1998 .

[15]  Moshe Dror,et al.  A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..

[16]  Jacques Desrosiers,et al.  Crew Pairing at Air France , 1993 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Knut Haase,et al.  The course scheduling problem at Lufthansa Technical Training , 1998, Eur. J. Oper. Res..

[19]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[20]  C. Roger Glassey,et al.  A Decision Support System for Assigning Classes to Rooms , 1986 .

[21]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[22]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[23]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[24]  Steven Swanson,et al.  Scheduling Classes on a College Campus , 2000, Comput. Optim. Appl..

[25]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[26]  Peter Brucker,et al.  Complexity of scheduling problems with multi-purpose machines , 1997, Ann. Oper. Res..