Robust Airline Crew Pairing: Move-up Crews

Published Online:https://doi.org/10.1287/trsc.1050.0131

References

  • Ageeva Y. Approaches to incorporating robustness into airline scheduling. (2000) . Master’s thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Barnhart C., Cohn A., Johnson E., Klabjan D., Nemhauser G., Vance P., Hall R. W. Airline crew scheduling. Handbook of Transportation Science (2003) (Kluwer)CrossrefGoogle Scholar
  • Bly E., Clarke J., Loy J., Melconian T., Rabbani F. MIT extensible air network simulation (MEANS). (2003) . Technical report, Massachussets Institute of Technology, Cambridge, MAGoogle Scholar
  • Bond D. Commercial aviation on the ropes. Aviation Week Space Tech. (2000) SeptemberGoogle Scholar
  • Bratu S., Barnhart C. Air traffic congestions: A macroscopic view. (2000) . Presentation for the Global Airline Industry Program, Massachussets Institute of Technology, Cambridge, MAGoogle Scholar
  • Desaulniers G., Desrosiers J., Ioachim I., Solomon M., Soumis F., Crainic T., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer)57–93CrossrefGoogle Scholar
  • Desaulniers G., Desrosiers J., Dumas Y., Marc S., Rioux B., Solomon M., Soumis F. Crew pairing at Air France. Eur. J. Oper. Res. (1997) 97:245–259CrossrefGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M., Soumis F., Ball M., Magnanti T., Monma C., Nemhauser G. Time constrained routing and scheduling. Handbook in Operations Research and Management Science, Network Routing (1995) (Elsevier Science Publishers)35–139Google Scholar
  • Donoghue J. Gaining strength. Air Transport World (2004) January):28–34Google Scholar
  • Ehrgott M., Ryan D. Bicriteria robustness versus cost optimization in tour of duty planning at Air New Zealand. (2001) . Technical report, University of AucklandGoogle Scholar
  • FAA (2003) . http://api.hq.faa.govGoogle Scholar
  • Fisher M. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18LinkGoogle Scholar
  • Kang L., Clarke J. Degradable airline scheduling. (2003) . Technical report, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Karow M. Virtual hubs: An airline schedule recovery concept and model. (2003) . Master’s thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Lan S., Clarke J., Barnhart C. Robust aircraft routing. (2003) . Technical report, Massachussets Institute of Technology, Cambridge, MAGoogle Scholar
  • Lemaréchal C., Nemhauser G., Kan A. R., Todd M. Nondifferentiable optimization. Optimization (1989) (Elsevier Science)529–572CrossrefGoogle Scholar
  • Listes O., Dekker R. A scenario aggregation based approach for determining a robust airline fleet composition. (2003) . Technical Report EI 2002-17, Rotterdam School of Economics, Rotterdam, The NetherlandsGoogle Scholar
  • Rosenberger J., Johnson E., Nemhauser G. A robust fleet assignment model with hub isolation and short cycles. Transportation Sci. (2004) 38:357–368LinkGoogle Scholar
  • Rosenberger J., Schaefer A., Goldsman D., Johnson E., Kleywegt A., Nemhauser G. A stochastic model of airline operations. Transportation Sci. (2002) 36:357–377LinkGoogle Scholar
  • Schaefer A., Johnson E., Kleywegt A., Nemhauser G. Airline crew scheduling under uncertainty. (2000) . Technical Report TLI-01-01, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
  • Stojković G., Soumis M., Desrosiers J. The operational airline crew scheduling problem. Transportation Sci. (1998) 32:232–245LinkGoogle Scholar
  • Yen J., Birge J. A stochastic programming approach to the airline crew scheduling problem. (2000) . Technical report, University of Washington, WAGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.