Airline Crew Scheduling with Time Windows and Plane-Count Constraints
Authors:
- 1 August 2002
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 36 (3) , 337-348
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Benders Decomposition for Simultaneous Aircraft Routing and Crew SchedulingTransportation Science, 2001
- Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong BranchingComputational Optimization and Applications, 2001
- Crew Scheduling1999
- Flight String Models for Aircraft Fleeting and RoutingTransportation Science, 1998
- A Method for Optimally Solving the Rostering Problem1998
- Integrated Airline Schedule Planning1998
- Operations Research in the Airline Industry1998
- Daily Aircraft Routing and SchedulingManagement Science, 1997
- The fleet assignment problem: Solving a large-scale integer programMathematical Programming, 1995
- Some properties of the fleet assignment problemOperations Research Letters, 1994