Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
From MaRDI portal
Publication:5704094
DOI10.1287/moor.27.3.504.311zbMath1082.90522OpenAlexW1978543710MaRDI QIDQ5704094
Eugene Levner, George M. Adelson-Velsky
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.27.3.504.311
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
An approach using SAT solvers for the RCPSP with logical constraints ⋮ Minimal functional routes in directed graphs with dependent edges
This page was built for publication: Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm