A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
From MaRDI portal
Publication:3114703
DOI10.1287/mnsc.47.6.833.9810zbMath1232.90210OpenAlexW2126847028MaRDI QIDQ3114703
Silvano Martello, Matteo Fischetti, Paolo Toth, Andrea Lodi
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.47.6.833.9810
Related Items
Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, Scheduling the vehicles of bus rapid transit systems: a case study, Reachability cuts for the vehicle routing problem with time windows, Workforce planning in a lotsizing mail processing problem, Railway crew scheduling: models, methods and applications, Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem, Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, A new ILP-based refinement heuristic for vehicle routing problems, An exact approach for the multi-depot electric bus scheduling problem with time windows
