Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

DOI10.1287/MOOR.27.3.504.311MaRDI QIDQ5704094zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

project scheduling, AND-OR graphs, Dijkstra's algorithm, polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2050889
• scientific article; zbMATH DE number 970004
• Makespan minimization in projects with threshold activities
• scientific article; zbMATH DE number 1163292
• Scheduling with AND/OR Precedence Constraints

Cited in

(7)

• Road traffic estimation and distribution-based route selection
• On fast path-finding algorithms in AND-OR graphs
• Makespan minimization in projects with threshold activities
• An approach using SAT solvers for the RCPSP with logical constraints
• Precedence-constrained shortest path
• Minimal functional routes in directed graphs with dependent edges
• scientific article; zbMATH DE number 2050889 (Why is no real title available?)

This page was built for publication: Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704094)