Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
From MaRDI portal
Publication:3947440
DOI10.1287/opre.30.4.760zbMath0486.90054MaRDI QIDQ3947440
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5379
posets; polynomial algorithm; chain-cover problem; countably infinite partially ordered sets; finite network flow problem; fixed periodic schedule; periodic posets
90B35: Deterministic scheduling theory in operations research
Related Items
Network models for vehicle and crew scheduling, Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case, Periodic assignment and graph colouring, Cyclic scheduling in a robotic production line, Vehicle minimization for periodic deliveries, An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times, Maximum-throughput dynamic network flows