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.90054OpenAlexW2116453789MaRDI 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
posetspolynomial algorithmchain-cover problemcountably infinite partially ordered setsfinite network flow problemfixed periodic scheduleperiodic posets
Related Items
Periodic assignment and graph colouring, Cyclic scheduling in a robotic production line, An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times, Vehicle minimization for periodic deliveries, Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case, Maximum-throughput dynamic network flows, Network models for vehicle and crew scheduling
