Optimized Crew Scheduling at Air New Zealand
- 1 February 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Informs Journal on Applied Analytics
- Vol. 31 (1), 30-56
- https://doi.org/10.1287/inte.31.1.30.9688
Abstract
The aircrew-scheduling problem consists of two important subproblems: the tours-of-duty planning problem to generate minimum-cost tours of duty (sequences of duty periods and rest periods) to cover all scheduled flights, and the rostering problem to assign tours of duty to individual crew members. Between 1986 and 1999, Air New Zealand staff and consultants in collaboration with the University of Auckland have developed eight application-specific optimization-based computer systems to solve all aspects of the tours-of-duty planning and rostering processes for Air New Zealand's national and international operations. These systems have saved NZ$15,655,000 per year while providing crew rosters that better respect crew members' preferences.Keywords
This publication has 19 references indexed in Scilit:
- An algorithm for large scale 0–1 integer programming with application to airline crew schedulingAnnals of Operations Research, 1995
- The Solution of Massive Generalized Set Partitioning Problems in Aircrew RosteringJournal of the Operational Research Society, 1992
- On the integer properties of scheduling set partitioning modelsEuropean Journal of Operational Research, 1988
- A new approach for crew pairing problems by column generation with an application to air transportationEuropean Journal of Operational Research, 1988
- Aspects of Bus Crew Scheduling Using a Set Partitioning ModelPublished by Springer Science and Business Media LLC ,1988
- Exact solution of crew scheduling problems using the set partitioning model: Recent successful applicationsNetworks, 1981
- Implicit enumeration algorithms for the Set-Partitioning ProblemOR Spectrum, 1980
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- Balanced matricesMathematical Programming, 1972
- A Technique for Resolving Degeneracy in Linear ProgrammingJournal of the Society for Industrial and Applied Mathematics, 1963