Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefragis, P., Goumopoulos, C., Housos, E., Sanders, P., Takkula, T., and Wedelin, D. (1998). Parallel crew scheduling in PAROS. In Proceedings of 1998 Europar/8, pages 1104–1113.
Alefragis, P., Sanders, P., Takkula, T., and Wedelin, D. (2000). Parallel integer optimization for crew scheduling. Annals of Operations Research, 99:141–166.
Anbil, R., Barnhart, C., Johnson, E., and Hatay, L. (1994). A column generation technique for the long-haul crew assignment problem. In Ciriani, T. and Leachman, R., editors, Optimization in Industry II, pages 7–24. John Wiley & Sons.
Andersson, E., Housos, E., Kohl, N., and Wedelin, D. (1998). Crew pairing optimization. In Yu, G., editor, Operations Research in the Airline Industry, pages 228–258. Kluwer Academic Publishers.
Anbil, R., Forrest, J., and Pulleyblank, W. (1998). Column generation and the airline crew pairing problem. In Extra Volume Proceedings ICM. Available from http://www.math.uiuc.edu/documenta/xvol-icm/17/17.html.
Anbil, R., Gelman, E., Patty, B., and Tanga, R. (1991). Recent advances in crew pairing optimization at American Airlines. Interfaces, 21:62–74.
Anbil, R., Johnson, E., and Tanga, R. (1992). A global approach to crew pairing optimization. IBM Systems Journal, 31:71–78.
Barahona, F. and Anbil, R. (1998). The volume algorithm: Producing primal solutions with a subgradient method. Technical Report RC-21103, T. J. Watson Research Center.
Barahona, F. and Anbil, R. (1999). On some difficult linear programs coming from set partitioning. Technical Report RC-21410, T. J. Watson Research Center.
Barnhart, C., Hatay, L., and Johnson, E. (1995). Deadhead selection for the long-haul crew pairing problem. Operations Research, 43:491–499.
Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., and Vance, P. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46:316–329.
Bixby, R., Cook, W., Cox, A., and Lee, E. (1995). Parallel mixed integer programming. Technical Report CRPC-TR95554, Rice University. Available from ftp://softlib.rice.edu/pub/CRPC-TRs/reports.
Bixby, R., Gregory, J., Lustig, I., Marsten, R., and Shanno, D. (1992). Very large-scale linear programming: A case study in combining interior point and simplex methods. Operations Research, 40:885–897.
Bond, D. (2000). Commercial aviation on the ropes. Aviation Week & Space Technology. September issue.
Brailsford, S., Potts, C., and Smith, B. (1999). Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research, 119:557–581.
Caprara, A., Toth, P., Vigo, D., and Fischetti, M. (1998). Modeling and solving the crew rostering problem. Operations Research, 46:820–830.
Chebalov, S. and Klabjan, D. (2002). Robust airline crew scheduling: Move-up crews. In Proceedings of the 2002 NSF Design, Service, and Manufacturing Grantees Research Conference.
Conn, A. and Barnhart, C. (2002). Improving crew scheduling by incorporating key maintenance routing decisions. Technical report, Massachusetts Institute of Technology. To appear in Operations Research.
Cordeau, J., Stojković, G., Soumis, F., and Desrosiers, J. (2001). Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science, 35:375–388.
Day, P. and Ryan, D. (1997). Flight attendant rostering for short-haul airline operations. Operations Research, 45:649–661.
Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M., and Soumis, F. (1998). A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In Crainic, T. and Laporte, G., editors, Fleet Management and Logistics, pages 57–93. Kluwer Publishing Company.
Desrochers, M. and Soumis, F. (1988). A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR, 26:191–212.
Desrochers, M. and Soumis, F. (1989). A column generation approach to the urban transit crew cheduling problem. Transportation Science, 23:1–13.
Desrosiers, J., Dumas, Y., Desrochers, M., Soumis, F., Sanso, B., and Trudeau, P. (1991). A breakthrough in airline crew scheduling. Technical Report G-91-11, Cahiers du GERAD.
du Merle, O., Villeneuve, D., Desrosiers, J., and Hanses, P. (1999). Stabilized column generation. Discrete Mathematics, 194:229–237.
Ehrgott, M. and Ryan, D. (2001). Bicriteria robustness versus cost optimization in tour of duty planning at Air New Zealand. Technical report, Univeristy of Auckland.
Fahle, T., Junker, V., Karish, S., Kohl, N., and Vaaben, B. (1999). Constraint programming based column generation for crew assignment. Journal of Heuristics. To appear.
Forrest, J. and Goldfarb, D. (1992). Steepest-edge simplex algorithms for linear programming. Mathematical Programming, 57:341–374.
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 Academic Publishers.
Gamache, M., Soumis, F., Marquis, G., and Desrosiers, J. (1999). A column generation approach for large scale aircrew rostering problems. Operations Research, 47:247–262.
Gamache, M., Soumis, F., Villeneuve, D., Desrosiers, J., and Gelinas, E. (1998). The preferential bidding system at Air Canada. Transportation Science, 32:246–255.
Gedron, B. and Crainic, T. (1994). Parallel branch-and-bound algorithms: Survey and synthesis. Operations Research, 42:1042–1066.
Gershkoff, I. (1989). Optimizing flight crew schedules. Interfaces, 19:29–43.
Goumopoulos, C., Housos, E., and Liljenzin, O. (1997). Parallel crew scheduling on workstation networks using PVM. In Proceedings of 1997 EuroPVM-MPI, volume 1332.
Hoffman, K. and Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39:657–682.
Hu, J. and Johnson, E. (1999). Computational results with a primal-dual subproblem simplex method. Operations Research Letters, 25:149–158.
Junker, U., Karisch, S., Kohl, N., Vaaben, B., Fahle, T., and Sellmann, M. (1999). A framework for constraint programming based column generation. In Proceedings of CP 1999, pages 261–274.
Klabjan, D. (2001). Next generation airline crew scheduling. Technical report, University of Illinois at Urbana-Champaign. Available from http://www.staff.uiuc.edu/~klabjan/reports/ngCS.pdf.
Klabjan, D., Johnson, E., and Nemhauser, G. (2000). A parallel primal-dual algorithm. Operations Research Letters, 27:47–55.
Klabjan, D., Johnson, E., Nemhauser, G., Gelman, E., and Ramaswamy, S. (2002). Airline crew scheduling with time windows and plane count constraints. Transportation Science, 36:337–348.
Klabjan, D., Johnson, E., Nemhauser, G., Gelman, E., and Ramaswamy, S. (2001a). Airline crew scheduling with regularity. Transportation Science, 35:359–374.
Klabjan, D., Johnson, E., Nemhauser, G., Gelman, E., and Ramaswamy, S. (2001b). Solving large airline crew scheduling problems: Random pairing generation and strong branching. Computational Optimization and Applications, 20:73–91.
Klabjan, D., Schaefer, A., Johnson, E., Kleywegt, A., and Nemhauser, G. (2001c). Robust airline crew scheduling. In Proceedings of TRISTAN IV, pages 275–280.
Klabjan, D. and Schwan, K. (2000). Airline crew pairing generation in parallel. In Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing.
Kornecki, A. and Vargas, D. (2000). Simulation-based training for airline controller operations. In Proceedings of Society of Computer Simulation 2000 Advanced Simulation Technologies Conference, pages 162–171.
Kwok, L. and Wu, L. (1996). Development of an expert system in cabin crew pattern generation. International Journal of Expert Systems, 9:445–464.
Lavoie, S., Minoux, M., and Odier, E. (1988). A new approach for crew pairing problems by column generation with an application to air transportation. European Journal of Operational Research, 35:45–58.
Lettovský, L. (1997). Airline Operations Recovery: An Optimization Approach. PhD thesis, Georgia Institute of Technology.
Lettovský, L., Johnson, E., and Nemhauser, G. (2000), Airline crew recovery. Transportation Science, 34:337–348.
Linderoth, J. and Savelsbergh, M. (1999). A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing, 11:173–187.
Lustig, I. and Puget, J. (2001). Program ≠program: constraint programming and its relationship to mathematical programming. Interfaces. To appear.
Makri, A. and Klabjan, D. (2001). Efficient column generation techniques for airline crew scheduling. Technical report, University of Illinois at Urbana-Champaign. Available from http://www.staff.uiuc.edu/~klabjan/professional.html.
Marsten, R. (1994). Crew planning at Delta Airlines. XV Mathematical Programming Symposium. Presentation.
Minoux, M. (1984). Column generation techniques in combinatorial optimization: a new application to crew pairing problems. In Proceedings XXIVth AGIFORS Symposium.
Rosenberger, J., Schaefer, A., Goldsman, D., Johnson, E., Kleywegt, A., and Nemhauser, G. (2000). A stochastic model of airline operations. Transportation Science. To appear. Available from http://tli.isye.gatech.edu.
Ryan, D. (1992). The solution of massive generalized set partitioning problems in air crew rostering. Journal of the Operational Research Society, 43:459–467.
Ryan, D. and Foster, B. (1981). An integer programming approach to scheduling. In Wren, A., editor, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pages 269–280. Elsevier Science B.V.
Sanders, P., Takkula, T., and Wedelin, D. (1999). High performance integer optimization for crew scheduling. In Proceedings of the HPCS’ 99. Available from http://www.cs.Chalmers.se/~tuomo.
Schaefer, A., Johnson, E., Kleywegt, A., and Nemhauser, G. (2000). Airline crew scheduling under uncertainty. Technical Report TLI-01-01, Georgia Institute of Technology.
Song, M., Wei, G., and Yu, G. (1998). A decision support framework for crew management during airline irregular operations. In Yu, G., editor, Operations Research in the Airline Industry, pages 260–286. Kluwer Academic Publishers.
Stojkovic, G., Soumis, M., and Desrosiers, J. (1998). The operational airline crew scheduling problem. Transportation Science, 32:232–245.
Teodorovic, D. and Stojkovic, G. (1990). Model for operational daily airline scheduling. Transportation Planning Technology, 14:273–285.
Vance, P., Atamtürk, A., Barnhart, C., Gelman, E., Johnson, E., Krishna, A., Mahidhara, D., Nemhauser, G., and Rebello, R. (1997a). A heuristic branch-and-price approach for the airline crew pairing problem. Technical Report LEC-97-06, Georgia Institute of Technology.
Vance, P., Barnhart, C., Johnson, E., and Nemhauser, G. (1997b). Airline crew scheduling: A new formulation and decomposition algorithm. Operations Research, 45:188–200.
Wedelin, D. (1995). An algorithm for large scale 0-1 integer programming with applications to airline crew scheduling. Annals of Operations Research, 57:283–301.
Wei, G. and Yu, G. (1997). Optimization model and algorithm for crew management during airline irregular operations. Journal of Combinatorial Optimization, 1:305–321.
Wilson, N., editor (1999). Computer-Aided Transit Scheduling. Springer Verlag.
Yen, J. and Birge, J. (2000). A stochastic programming approach to the airline crew scheduling problem. Technical report, University of Washington.
Yu, G., editor (1998). Operations Research in the Airline Industry, Kluwer Academic Publishers.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Barnhart, C., Cohn, A.M., Johnson, E.L., Klabjan, D., Nemhauser, G.L., Vance, P.H. (2003). Airline Crew Scheduling. In: Hall, R.W. (eds) Handbook of Transportation Science. International Series in Operations Research & Management Science, vol 56. Springer, Boston, MA. https://doi.org/10.1007/0-306-48058-1_14
Download citation
DOI: https://doi.org/10.1007/0-306-48058-1_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7246-8
Online ISBN: 978-0-306-48058-4
eBook Packages: Springer Book Archive