Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
Published Online:13 Dec 2021https://doi.org/10.1287/opre.2021.2155
References
- (1993) Network Flows: Theory, Algorithms and Applications (Prentice-Hall, Hoboken, NJ).Google Scholar
- (2019) Robust efficiency in urban public transportation: Minimizing delay propagation in cost-efficient bus and driver schedules. Transportation Sci. 53(1):89–112.Link, Google Scholar
- (2000) Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1):40–55.Crossref, Google Scholar
- (2017) Optimal network design with end-to-end service requirements. Oper. Res. 65(3):729–750.Link, Google Scholar
- (2021) Network design with routing restrictions. Crainic TG, Gendreau, M, Gendron B, eds. Network Design with Applications to Transportation and Logistics (Springer, Heidelberg), 209–253.Crossref, Google Scholar
- (1996) A tree search algorithm for the crew scheduling problem. Eur. J. Oper. Res. 94:517–526.Crossref, Google Scholar
- (1998) A dynamic programming-based algorithm for the crew scheduling problem. Comput. Oper. Res. 25:567–582.Crossref, Google Scholar
- (1994) A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Software 3(1-3):163–194.Crossref, Google Scholar
- (2004) An exact algorithm for the simplified multiple depot crew scheduling problem. Ann. Oper. Res. 127:177–201.Crossref, Google Scholar
- (2004) A multicommodity flow approach to the crew rostering problem. Oper. Res. 52(4):583–596.Link, Google Scholar
- (1998) Modeling and solving the crew rostering problem. Oper. Res. 46(6):820–830.Link, Google Scholar
- (1989) A column generation approach to the urban transit crew scheduling problem. Transportation Sci. 23(1):1–13.Link, Google Scholar
- (2007) Public transit. Barnhart C, Laporte G, eds. Handbooks in OR & MS: Transportation, vol. 14. (Elsevier, Amsterdam), 69–127.Google Scholar
- (2004a) Staff scheduling and rostering: A review of applications, methods, and models. Eur. J. Oper. Res. 153:3–27.Crossref, Google Scholar
- (2004b) An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1-4):21–144.Crossref, Google Scholar
- (1987) The fixed job schedule problem with spread-time constraints. Oper. Res. 35(6):849–858.Link, Google Scholar
- (1989) The fixed job schedule problem with working-time constraints. Oper. Res. 37(3):395–403.Link, Google Scholar
- (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. 47(6):833–850.Link, Google Scholar
- (2013) Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. EURO J. Comput. Optim. 1:283–312.Crossref, Google Scholar
- (2006) A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54(1):130–149.Link, Google Scholar
- (2015) Planning, operation, and control of bus transport systems: A literature review. Transportation Res. Part B: Methodological 77:38–75.Crossref, Google Scholar
- (2015) Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241:1–14.Crossref, Google Scholar
- (1998) Vehicle scheduling in public transit and Lagrangian pricing. Management Sci. 44(12-part-1):1637–1649.Link, Google Scholar
- (1999) A set partitioning approach to the crew scheduling problem. Oper. Res. 47(6):873–888.Link, Google Scholar
- (2006) Vehicle and crew scheduling for urban bus lines. Eur. J. Oper. Res. 170:844–862.Crossref, Google Scholar
- (1999) Integer and Combinatorial Optimization (John Wiley & Sons, Hoboken, NJ).Google Scholar

