This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Adelson-Velsky, G. M. Articles by Levner, E. Search for Related Content

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

Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, 52900, Israel
Department of Computer Science, Holon Academic Institute of Technology, Holon, 58102, Israel

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.

Key Words: Project scheduling; AND-OR graphs; Dijkstra's algorithm; polynomial algorithm
History: Received: April 28, 2000; revision received: September 24, 2001;