Article ID: | iaor2004197 |
Country: | United States |
Volume: | 36 |
Issue: | 3 |
Start Page Number: | 337 |
End Page Number: | 348 |
Publication Date: | Aug 2002 |
Journal: | Trans Science |
Authors: | Nemhauser George L., Gelman Eric, Johnson Ellis L., Klabjan Diego, Ramaswamy Srini |
Keywords: | scheduling |
Airline planning consists of several problems that are currently solved separately. We address a partial integration of schedule planning, aircraft routing, and crew scheduling. In particular, we provide more flexibility for crew scheduling while maintaining the feasibility of aircraft routing by adding plane-count constraints to the crew-scheduling problem. In addition, we assume that the departure times of flights have not yet been fixed and we are allowed to move the departure time of a flight as long as it is within a given time window. We demonstrate that such a model yields solutions to the crew-scheduling problem with significantly lower costs than those obtained from the traditional model.