Multiple-Depot Integrated Vehicle and Crew Scheduling

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

References

  • Bertossi A. A., Carraresi P., Gallo G. On some matching problems arising in vehicle scheduling models. Networks (1987) 17:271–281CrossrefGoogle Scholar
  • Carraresi P., Girardi L., Nonato M., Daduna J. R., Branco I., Paixão J. M. Pinto. Network models, Lagrangean relaxation and subgradients bundle approach in crew scheduling problems. Computer-Aided Transit Scheduling: Proceedings of the Sixth International Workshop (1995) (Springer Verlag, Berlin, Germany) 188–212CrossrefGoogle Scholar
  • Cordeau J.-F., Stojković G., Soumis F., Desrosiers J. Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. (2001) 35:375–388LinkGoogle Scholar
  • Dell’Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. (1993) 39:115–125LinkGoogle Scholar
  • Desaulniers G., Cordeau J.-F., Desrosiers J. Simultaneous multi-depot bus and driver scheduling. (2001) . TRISTAN IV preprintsGoogle Scholar
  • Fischetti M., Martello S., Toth P. The fixed job schedule problem with working-time constraints. Oper. Res. (1989) 37:395–403LinkGoogle Scholar
  • Freling R.Models and Techniques for Integrating Vehicle and Crew Scheduling (1997) . Ph.D. thesis, Tinbergen Institute, Erasmus University Rotterdam, Rotterdam, The NetherlandsGoogle Scholar
  • Freling R., Boender G. C. E., Paixão J. M. Pinto. An integrated approach to vehicle and crew scheduling. (1995) . Technical Report 9503/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The NetherlandsGoogle Scholar
  • Freling R., Huisman D., Wagelmans A. P. M., Voß S., Daduna J. R. Applying an integrated approach to vehicle and crew scheduling in practice. Computer-Aided Scheduling of Public Transport (2001) (Springer, Berlin, Germany) 73–90CrossrefGoogle Scholar
  • Freling R., Huisman D., Wagelmans A. P. M. Models and algorithms for integration of vehicle and crew scheduling. J. Scheduling (2003) 6:63–85CrossrefGoogle Scholar
  • Freling R., Wagelmans A. P. M., Paixão J. M. Pinto, Wilson N. H. M. An overview of models and techniques for integrating vehicle and crew scheduling. Computer-Aided Transit Scheduling (1999) (Springer Verlag, Berlin, Germany) 441–460CrossrefGoogle Scholar
  • Gaffi A., Nonato M., Wilson N. H. M. An integrated approach to extra-urban crew and vehicle scheduling. Computer-Aided Transit Scheduling (1999) (Springer Verlag, Berlin, Germany) 103–128CrossrefGoogle Scholar
  • Haase K., Friberg C., Wilson N. H. M. An exact branch and cut algorithm for the vehicle and crew scheduling problem. Computer-Aided Transit Scheduling (1999) (Springer Verlag, Berlin, Germany) 63–80Google Scholar
  • Haase K., Desaulniers G., Desrosiers J. Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Sci. (2001) 35:286–303LinkGoogle Scholar
  • Huisman D. Integrated and dynamic vehicle and crew scheduling. (2004) . Ph.D. thesis, Tinbergen Institute, Erasmus University Rotterdam, Rotterdam, The NetherlandsGoogle Scholar
  • Huisman D., Freling R., Wagelmans A. P. M. A robust solution approach to the dynamic vehicle scheduling problem. Transportation Sci. (2004) 38:447–458LinkGoogle Scholar
  • Klabjan D., Johnson E. L., Nemhauser G. L., Gelman E., Ramaswamy S. Airline crew scheduling with time windows and plane-count constraints. Transportation Sci. (2002) 36:337–348LinkGoogle Scholar
  • Patrikalakis I., Xerocostas D., Desrochers M., Rousseau J. M. A new decomposition scheme of the urban public transport scheduling problem. Computer-Aided Transit Scheduling: Proceedings of the Fifth International Workshop (1992) (Springer Verlag, Berlin, Germany) 407–425CrossrefGoogle 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.