Abstract
The problem of minimizing the duration of a project is studied in situations involving activities which can be started only after a prescribed number of immediately preceding activities have been performed. A strongly polynomial Dijkstra-type algorithm for solving the problem is proposed and analyzed. The algorithm is applicable to projects with activities of positive lengths, even if the underlying precedence graph contains cycles.
| Original language | English |
|---|---|
| Pages (from-to) | 195-204 |
| Number of pages | 10 |
| Journal | Asia-Pacific Journal of Operational Research |
| Volume | 19 |
| Issue number | 2 |
| State | Published - Nov 2002 |
| Externally published | Yes |
Keywords
- AND/OR graphs
- Dijkstra-type algorithm
- Project scheduling
- Threshold activities