A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
From MaRDI portal
Recommendations
- A solution approach for dynamic vehicle and crew scheduling
- scientific article; zbMATH DE number 1361553
- Vehicle and crew scheduling: solving large real-world instances with an integrated approach
- An exact algorithm for the simplified multiple depot crew scheduling problem
- The crew timetabling problem: an extension of the crew scheduling problem
- scientific article; zbMATH DE number 4162637
- A polyhedral approach for the staff rostering problem
- scientific article; zbMATH DE number 1683915
- scientific article; zbMATH DE number 1452994
- An analog of the flexible polyhedron method for scheduling problems
Cited in
(18)- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation
- Workforce planning in a lotsizing mail processing problem
- An exact algorithm for the simplified multiple depot crew scheduling problem
- An exact approach for the multi-depot electric bus scheduling problem with time windows
- Railway crew scheduling: models, methods and applications
- Reachability cuts for the vehicle routing problem with time windows
- A new ILP-based refinement heuristic for vehicle routing problems
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- A crew scheduling approach for public transit enhanced with aspects from vehicle scheduling
- scientific article; zbMATH DE number 1361553 (Why is no real title available?)
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- Scheduling the vehicles of bus rapid transit systems: a case study
- Vehicle scheduling based on a line plan
- On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method
- A model for bus crew scheduling problem with multiple duty types
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
This page was built for publication: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114703)
