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

DOI10.1016/S0377-2217(97)00339-1zbMath0943.90035WikidataQ127230271 ScholiaQ127230271MaRDI QIDQ1296095

Vladimir Kats, Eugene Levner

Publication date: 10 September 2000

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

zbMATH Keywords

polynomial algorithmsassignment problemperiodic schedulingairplane scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Cyclic scheduling in a robotic production line ⋮ Vehicle minimization for periodic deliveries

Cites Work

• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
• Unnamed Item
• Unnamed Item

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