Project duration in stoshastic network by the PERT-path technique
By: PONTRANDOLFO, Pierpaolo
.
Material type: 
ArticlePublisher: jun.2000Subject(s): PERT-path Technique | Merge Even Bias | Stochastic Network SchedulingInternational Journal of Project Management 18, 3, p. 215-222Abstract: Market turbulence, higher innovation rates and increasing organisational complexity, are among the reasons that have made project management concepts spread to several industries. This has emphasised complexity of projects and uncertainty in estimating activity duration, resulting in a higher criticality of project scheduling. PERT-state and PERT-path techniques address the project scheduling problem, focusing on network complexity and time uncertainty. Moving from these techniques, we discuss the concept of project evolution, which is defined as the sequence of project states (path) with the dates of transition between states. After a brief analysis of the stochastic project scheduling problem, we derive the equations that put into relations the duration of the project and those of every possible PERT-path. Based on these equations, an algorithm for determining the precise project duration is develped. It requires that path data be determined, which is possible and relatively easy when project activities are characterised by stochastic independence. Should not this be the case, the approach provides an approximate estimate of the project duration
| Item type | Current location | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
| Periódico | Biblioteca Graciliano Ramos | Periódico | Not for loan |
Market turbulence, higher innovation rates and increasing organisational complexity, are among the reasons that have made project management concepts spread to several industries. This has emphasised complexity of projects and uncertainty in estimating activity duration, resulting in a higher criticality of project scheduling. PERT-state and PERT-path techniques address the project scheduling problem, focusing on network complexity and time uncertainty. Moving from these techniques, we discuss the concept of project evolution, which is defined as the sequence of project states (path) with the dates of transition between states. After a brief analysis of the stochastic project scheduling problem, we derive the equations that put into relations the duration of the project and those of every possible PERT-path. Based on these equations, an algorithm for determining the precise project duration is develped. It requires that path data be determined, which is possible and relatively easy when project activities are characterised by stochastic independence. Should not this be the case, the approach provides an approximate estimate of the project duration
Click on an image to view it in the image viewer
There are no comments for this item.