Vehicle scheduling based on a line plan

DOI10.4230/OASICS.ATMOS.2018.15MaRDI QIDQ6594077zbMATH OpenFDO

Authors Rolf Nelson van Lieshout, Paul Bouman

Publication date 27 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2018.15

zbMATH Keywords

(fractional) matchingintegrated railway planningtreewidthvehicle scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The basic problem of vehicle scheduling can be solved by maximum bipartite matching
• A simple way to compute the number of vehicles that are required to operate a periodic timetable
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• Algorithms and hardness for non-pool-based line planning
• scientific article; zbMATH DE number 978511

Cited in

(1)

• A simple way to compute the number of vehicles that are required to operate a periodic timetable

This page was built for publication: Vehicle scheduling based on a line plan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594077)