haku: @indexterm PROJECT MANAGEMENT / yhteensä: 904
viite: 390 / 904
| Tekijä: | Soroush, H. |
| Otsikko: | The most critical path in a PERT network |
| Lehti: | Journal of the Operational Research Society
1994 : MAR, VOL. 45:3, p. 287-300 |
| Asiasana: | NETWORKS PROJECT MANAGEMENT PERT |
| Kieli: | eng |
| Tiivistelmä: | The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a project by a given deadline. However, in general, such a path is not the "most critical" path and does not provide the smallest estimate for the probability of completion time. This paper studies the "most critical path" problem and formulates it as an optimal path problem in a deterministic network with a two-attribute fractional objective function. |
SCIMA