Article ID: | iaor20021141 |
Country: | China |
Volume: | 37 |
Issue: | 5 |
Start Page Number: | 683 |
End Page Number: | 687 |
Publication Date: | Oct 2000 |
Journal: | Journal of Sichuan University |
Authors: | Li Zuoan, Xie Fanrong |
Keywords: | planning, networks: scheduling |
An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O(n3). The theory, which the algorithm depends on, is verified in detail.