Crew Scheduling
Crew scheduling consists of deciding the flight schedules of the
crew. This is done according to their qualification in flying certain
types of fleets (aircraft type rating), by respecting labor and contractual
rules, and minimizing crew expenses. Crew expenses are wages and
overnight costs while away from their crew base.
Need for Integrated Optimization
The need for Optimization Integration comes from the fact that crew
of a specific type rating can only fly a subset of available aircraft
types. As a result fleet assignment
decisions influence the cost of crew scheduling.
Another reason why Optimization Integration is needed stems from the
fact that it is possible for the crew to remain on the same aircraft
instead of commuting within the airport for their next flight. The
aircraft needed for their next flight is predetermined by the
aircraft routing, thus
once more upstream decisions influence crew scheduling.
SchedulAir™, however,
when optimizing takes into account simultaneously fleet assignment,
aircraft routing (with maintenance) and crew scheduling, to fully
integrate all the factors involved and provide the best schedule.
Back to Airline Scheduling
(Integrated Optimization) project.
Bibliography
- Anbil, R., Forrest, J., and Pulleyblank, W. (1998). Column generation and
the airline crew pairing problem. Documenta Mathematica, Extra Volume
ICM(III):677-686.
- Arabeyre, J., Fearnley, J., Steiger, F., and Teather, W. (1969). The
airline crew scheduling problem: A survey. Transportation Science,
3(2):140-163.
- Barnhart, C., Cohn, A., Johnson, E., Klabjan, D., Nemhauser, G.,
and P.Vance (2003). Airline crewscheduling. In Hall, R., editor,
Handbook of Transportation Science, chapter 3, pages 57-93. Kluwer
Scientific Publishers, Boston.
- Barnhart, C. and Shenoi, R. (1998). An approximate model and solution
approach for the long-haul crew pairing problem. Transportation Science,
32(3):221-231.
- Chebalov, S. and Klabjan, D. (2002). Robust airline crew scheduling: Moveup
crews. In Proceedings of the 2002 NSF Design, Service, and Manufacturing
Grantees and Research Conference.
- Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B.,
Solomon, M., and Soumis, F. (1997). Crew pairing at Air
France. European Journal of Operational Research, 97:245-259.
- Desaulniers, G., Desrosiers, J., Gamache, M., and Soumis, F. (1998). Crew
scheduling in air transportation. In Crainic, T. G. and Laporte, G., editors,
Fleet Management and Logistics, chapter 8, pages
169-185. Kluwer, Boston.
- Gamache, M. and Soumis, F. (1998). A method for optimally solving
the rostering problem. In Yu, G., editor, Operations Research in the
Airline Industry, pages 124-157. Kluwer, Boston.
- Hoffman, K. and Padberg, M. (1993). Solving airline crewscheduling
by branchand-cut. Management Science, 39(6):657-682.
- Klabjan,D., Johnson, E.,Nemhauser,G.,Gelman, E., and Ramaswamy, S. (2001).
Solving large airline crew scheduling problems: Random pairing and strong
branching. Computational Optimization and Applications, 20:79-91.
- Lavoie, S., Minoux, M., and Odier, E. (1988). A new approach for
crew pairing problems by column generation with applications to air
transport. European Journal of Operational Research, 35:45-58.
- Lettovský, L., Johnson, E., and Nemhauser, G. (2000). Airline
crew recovery. Transportation Science, 34(4):337-348.
- Makri, A. and Klabjan, D. (2004). A new pricing scheme for airline crew
scheduling. INFORMS: Journal on Computing, 16(1):56-67.
- Rubin, J. (1973). A technique for the solution of massive set
covering problems, with application to airline
crew scheduling. Transportation Science, 7(1):34-48.
- Sellmann, M., Zervoudakis, K., Stamatopoulos, P., and Fahle,
T. (2002). Crew assignment via constraint programming: Integrating
column generation and heuristic tree search. Annals of Operations
Research, 115:207-225.
- Vance, P., Atamtürk, A., Barnhart, C., Gelman, E., Johnson, E.,
Krishna, A., Mahidhara, D., Nemhauser, G., and Rebello, R. (1997). A
heuristic branch-and-price approach for the airline crew pairing
problem. Technical Report LEC 97-06, School of Industrial and Systems
Engineering, Georgia Institute of Technology, Georgia.
|
|