Optimized Crew Scheduling at Air New Zealand

References

• Albers S. Implicit enumeration algorithms for the set-partitioning problem. OR Spektrum (1980) 2(1):23–32Crossref, Google Scholar
• Allard D. (2000) . supporting letter dated March 9, 2000 provided as part of Franz Edelman 2000 finalist submissionGoogle Scholar
• Anbil R., Forrest J., Pulleyblank W. Column generation and the airline crew pairing problem. Documenta Mathematica (1998) (Extra volume ICM, III)677–686Google Scholar
• Anbil R., Gelman E., Patty B., Tanga R. Recent advances in crew-pairing optimization at American Airlines. Interfaces (1991) 21(1):62–74(January-February)Link, Google Scholar
• Berge C. Balanced matrices. Mathematical Programming (1972) 2(1):19–31Crossref, Google Scholar
• Boyd E. A. Resolving degeneracy in combinatorial linear programming: Steepest edge, steepest ascent and parametric ascent. Mathematical Programming (1995) 68(2):155–168Crossref, Google Scholar
• Clarke R. J. Crew rostering using assignment algorithms. (1989) (University of Auckland, New Zealand) . Masters thesis, Department of Engineering ScienceGoogle Scholar
• Day P. R. Flight attendant rostering for short-haul airline operations. (1996) (University of Auckland, New Zealand) . PhD thesis, Department of Engineering ScienceGoogle Scholar
• Day P. R., Ryan D. M. Flight attendant rostering for short-haul airline operations. Operations Research (1997) 45(5):649–661Link, Google Scholar
• Deaker J. Construction of standby crew patterns for international flight attendants at Air New Zealand. Proceedings of the 30th Annual Conference of ORSNZ (1994) (Operational Research Society of New Zealand)74–79Google Scholar
• Desrosiers J., Dumas Y., Desrosiers M., Soumis F., Sanso B., Trudeau P. A breakthrough in airline crew scheduling. Cahiers du GERAD (1991) (Montreal, Canada) . Report G-91-11Google Scholar
• Falkner J. C. Bus crew-scheduling and the set partitioning model. (1988) (University of Auckland, New Zealand) . PhD thesis, Department of Engineering ScienceGoogle Scholar
• Forrest J., Goldfarb D. Steepest-edge simplex algorithms for linear programming. Mathematical Programming (1992) 57(3):341–374Crossref, Google Scholar
• Gamache M., Soumis F., Marquis G., Desrosiers J. A column generation approach for large scale aircrew rostering problems. Operations Research (1999) 47(2):247–263Link, Google Scholar
• Goldfarb D., Reid J. A practicable steepest-edge simplex algorithm. Mathematical Programming (1977) 12(3):361–371Crossref, Google Scholar
• Goldie A. P. Optimal airline crew-scheduling using dynamic column generation. (1996) (University of Auckland, New Zealand) . Masters thesis, Department of Engineering ScienceGoogle Scholar
• Lavoie S., Minoux M., Odier E. A new approach for crew pairing problems by column generation with an application to air transportation. European Journal of Operational Research (1988) 35(1):45–58Crossref, Google Scholar
• Marsten R. E. An algorithm for large set partitioning problems. Management Science (1974) 20(5):774–787Link, Google Scholar
• Marsten R. E., Shepardson F. Exact solution of crew-scheduling problems using the set partitioning model: Recent successful applications. Networks (1981) 11:165–177Crossref, Google Scholar
• Minoux M. Column generation techniques in combinatorial optimization—A new application to crew pairing. Proceedings of XXIV AGIFORS (1984) (Symposium, Strasbourg, France) 15–30Google Scholar
• Mueller M. Air crew rostering for Air New Zealand. (1985) (University of Auckland, New Zealand) . Third professional project report, Department of Engineering ScienceGoogle Scholar
• Padberg M. Perfect zero-one matrices. Mathematical Programming (1974) 6(2):180–196Crossref, Google Scholar
• Rubin J. A technique for the solution of massive set covering problems, with application to airline crew-scheduling. Transportation Science (1973) 7(1):34–48Link, Google Scholar
• Ryan D. M. ZIP— A zero-one integer programming package for scheduling. (1980) (Harwell, Oxfordshire) . Computer Science and Systems Division Report 85, Atomic Energy Research EstablishmentGoogle Scholar
• Ryan D. M. The solution of massive generalised set partitioning problems in aircrew rostering. Journal of the Operational Research Society (1992) 43(5):459–467Crossref, Google Scholar
• Ryan D. M., Falkner J. C. On the integer properties of scheduling set partitioning models. European Journal of Operational Research (1988) 35(3):442–456Crossref, Google Scholar
• Ryan D. M., Foster B. A., Wren A. An integer programming approach to scheduling. in Computer Scheduling of Public Transport (1981) (North-Holland, Amsterdam)269–280Google Scholar
• Ryan D. M., Osborne M. R. On the solution of highly degenerate linear programmes. Mathematical Programming (1988) 41(3):385–392Crossref, Google Scholar
• Thornley M. O. Crew rostering under a seniority preferential bidding environment using column generation. (1995) (New Zealand). Masters thesis, Department of Engineering ScienceGoogle Scholar
• Waite J. R. F. Language assignment for flight attendant rostering. (1995) (University of Auckland, New Zealand) . Project report, Department of Engineering ScienceGoogle Scholar
• Wallace C. A. Construction of optimal tours-of-duty for long-haul flight attendants. (2000) (University of Auckland, New Zealand) . PhD thesis (in preparation), Department of Engineering ScienceGoogle Scholar
• Wedelin D. An algorithm for large scale 0-1 integer programming with application to airline crew-scheduling. Annals of Operations Research (1995) 57:283–301Crossref, Google Scholar
• Wolfe P. A technique for resolving degeneracy in linear programming. Journal of the Society for Industrial and Applied Mathematics (1963) 11(2):205–211Crossref, Google Scholar