| Article ID: | iaor19951105 |
| Country: | United Kingdom |
| Volume: | 22 |
| Issue: | 4 |
| Start Page Number: | 401 |
| End Page Number: | 407 |
| Publication Date: | Jul 1994 |
| Journal: | OMEGA |
| Authors: | Wu Y., Li C. |
The problem of determining the minimal cost network in PERT or CPM has been studied and analysed many times. Various methods have been published for this problem, but each method has its own shortcomings. None perfectly solves the problem theoretically and practically. This note applies the cut set theory of networks. In this way, the problem of the minimal cost network in PERT and CPM can be perfectly solved theoretically and practically.