| Article ID: | iaor20032755 |
| Country: | Singapore |
| Volume: | 19 |
| Issue: | 2 |
| Start Page Number: | 195 |
| End Page Number: | 204 |
| Publication Date: | Nov 2002 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Levner Eugene, Vlach Milan, Sung Shao Chin |
| Keywords: | scheduling, networks: path |
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.