TY - JOUR

T1 - Project scheduling in AND-OR graphs

T2 - A generalization of Dijkstra's algorithm

AU - Adelson-Velsky, George M.

AU - Levner, Eugene

PY - 2002/8

Y1 - 2002/8

N2 - The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc lengths represent operation durations. The graphs have two types of nodes - AND-nodes and OR-nodes. The problem is to find the earliest starting times for all operations. This problem generalizes the shortest path problem and the critical path problem. The complexity of the suggested algorithm is O(p′ p) where p′ is the number of arcs entering the AND-nodes and p is the total number of arcs.

AB - The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc lengths represent operation durations. The graphs have two types of nodes - AND-nodes and OR-nodes. The problem is to find the earliest starting times for all operations. This problem generalizes the shortest path problem and the critical path problem. The complexity of the suggested algorithm is O(p′ p) where p′ is the number of arcs entering the AND-nodes and p is the total number of arcs.

KW - AND-OR graphs

KW - Dijkstra's algorithm

KW - Polynomial algorithm

KW - Project scheduling

UR - http://www.scopus.com/inward/record.url?scp=0036672665&partnerID=8YFLogxK

U2 - 10.1287/moor.27.3.504.311

DO - 10.1287/moor.27.3.504.311

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036672665

SN - 0364-765X

VL - 27

SP - 504

EP - 517

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 3

ER -