A New Pricing Scheme for Airline Crew Scheduling

References

• Anbil R., Johnson E., Tanga R. A global optimization approach to crew scheduling. IBM Systems J. (1991a) 31:62–74Google Scholar
• Anbil R., Forrest J., Pulleyblank W. R. Column generation and the airline crew pairing problem. Extra Volume Proc. Internat. Congress of Mathematicians (1998) Berlin, Germany http://www.math.uiuc.edu/documenta/xvol-icm/17/17.htmlCrossref, Google Scholar
• Anbil R., Gelman E., Patty B., Tanga R. Recent advances in crew pairing optimization at American Airlines. Interfaces (1991b) 21:62–74Link, Google Scholar
• Anderson E., Housos E., Kohl N., Wedelin D., Yu G. Crew pairing optimization. Operations Research in the Airline Industry (1998) (Kluwer, Boston, MA) 228–258Crossref, Google Scholar
• Barnhart C., Johnson E., Nemhauser G., Vance P., Hall R. Crew scheduling. Handbook of Transportation Science (1999) (Kluwer, Boston, MA) 493–521Crossref, Google Scholar
• Barnhart C., Cohn A., Johnson E., Klabjan D., Nemhauser G., Vance P., Hall R. Airline crew scheduling. Handbook of Transportation Science (2003) (Kluwer, Boston, MA) 517–560Crossref, Google Scholar
• Bixby R., Gregory J., Lustig I., Marsten R., Shanno D. Very large-scale linear programming: A case study in combining interior point and simplex methods. Oper. Res. (1992) 40:885–897Link, Google 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, Boston, MA) 57–93Crossref, Google Scholar
• Desrochers M., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–212Google Scholar
• Desrosiers J., Dumas Y., Desrochers M., Soumis F., Sanso B., Trudeau P. A breakthrough in airline crew scheduling. (1991) . Technical Report G-91-11, Groupe d'Etudes et de Recherche en Analyse des Decisions, Montreal, CanadaGoogle Scholar
• Desrosiers J., Dumas Y., Solomon M., Soumis F., Ball M., Magnanti T., Monma C., Nehmhauser G. Time constrained routing and scheduling. Handbook in Operations Research/Management Science, Network Routing (1995) 8(Elsevier Science, Amsterdam, The Netherlands) 35–139Google Scholar
• Gershoff I. Optimizing flight crew schedules. Interfaces (1989) 19:29–43Link, Google Scholar
• Gopalakrishnan B., Johnson E., Lee E., Pritchett A. A subproblem approach for solving the airline crew pairing problem. (2001) Presentation at INFORMS Fall 2001, Miami Beach, FLGoogle Scholar
• Hu J., Johnson E. Computational results with a primal-dual subproblem simplex method. Oper. Res. Lett. (1999) 25:149–158Crossref, Google Scholar
• Klabjan D., Johnson E., Nemhauser G. Solving large airline crew scheduling problems: Random pairing generation and strong branching. Comput. Optim. Appl. (2001) 20:73–91Crossref, Google Scholar
• Makri A., Klabjan D. Algorithms for source-to-all maximum cost to time ratio problem in acyclic networks. Networks (2003) 42:1–14Crossref, Google Scholar
• Vance P., Atamtürk A., Barnhart C., Gelman E., Johnson E., Krishna A., Mahidhara D., Nemhauser G., Rebello R. A heuristic branch-and-price approach for the airline crew pairing problem. (1997) . Technical Report LEC-97-06, Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar