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

From MaRDI portal

Revision as of 23:15, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3947440

Jump to:navigation, search

DOI10.1287/opre.30.4.760zbMath0486.90054OpenAlexW2116453789MaRDI QIDQ3947440

James B. Orlin

Publication date: 1982

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5379

zbMATH Keywords

posets polynomial algorithm chain-cover problem countably infinite partially ordered sets finite network flow problem fixed periodic schedule periodic posets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

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

This page was built for publication: Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3947440&oldid=17643764"