Article ID: | iaor19961589 |
Country: | United Kingdom |
Volume: | 23 |
Issue: | 5 |
Start Page Number: | 557 |
End Page Number: | 566 |
Publication Date: | Oct 1995 |
Journal: | OMEGA |
Authors: | Dawson C.W. |
Keywords: | simulation, networks: scheduling |
Most probabilistic activity networks (e.g. PERT) of any reasonable size are practically impossible to analyse mathematically in an acceptable time. This problem is augmented when stochastic branching is introduced to form generalized activity networks. For this reason simulation has proved to be one of the more popular and ‘accurate’ techniques available for network attribute analysis. In this paper a dynamic sampling technique is introduced that improves on the standard simulation approach used in popular project management software tools. A comparison is also made between the simulation requirements of standard probabilistic activity networks and a finite sample set of generalized activity networks in which activities are assigned either dependent or independent probability generations.