Name
Abstract | ||
|---|---|---|
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 Op' p where p' is the number of arcs entering the AND-nodes and p is the total number of arcs. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1287/moor.27.3.504.311 | Math. Oper. Res. |
Keywords | DocType | Volume |
project scheduling problem,arc length,critical path problem,polynomial algorithm,project scheduling,total number,operation duration,dijkstra's algorithm,algorithm iso,and-or graphs,and-nodes andp,shortest path problem | Journal | 27 |
Issue | ISSN | Citations |
3 | 0364-765X | 6 |
PageRank | References | Authors |
0.65 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George M. Adelson-Velsky | 1 | 6 | 0.65 |
| Eugene Levner | 2 | 466 | 48.53 |