Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

DOI10.1016/S0377-2217(97)00339-1MaRDI QIDQ1296095zbMATH OpenWikidataFDO

Authors Vladimir Kats, Eugene Levner

Publication date 10 September 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00339-1

zbMATH Keywords

assignment problempolynomial algorithmsperiodic schedulingairplane scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Vehicle minimization for periodic deliveries
• Scheduling vehicles on trees
• Models and Algorithms for Single-Depot Vehicle Scheduling
• scientific article; zbMATH DE number 915579
• scientific article; zbMATH DE number 1264445

Cites work

• scientific article; zbMATH DE number 3121292 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets

Cited in

(3)

• On a routing and scheduling problem concerning multiple edge traversals in graphs
• Cyclic scheduling in a robotic production line
• Vehicle minimization for periodic deliveries

This page was built for publication: Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

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