Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1287/opre.1030.0076 | Operations Research |
Keywords | Field | DocType |
continental airlines,rolling horizon,class scheduling,branch-and-bound algorithm,near-optimal solution,class scheduling problem,acceptable time limit,significant cost,consecutive week,pilot training,computational experiment,new assignment,computer experiment,scheduling problem,branch and bound algorithm | Mathematical optimization,Job shop scheduling,Fair-share scheduling,Flow shop scheduling,Two-level scheduling,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 1 | 0030-364X |
Citations | PageRank | References |
4 | 0.52 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiangtong Qi | 1 | 189 | 20.19 |
| Jonathan F. Bard | 2 | 1428 | 144.29 |
| Gang Yu | 3 | 431 | 34.83 |