Bounding the distribution of project duration in PERT networks

0.00 Avg rating—0 Votes

Article ID:	iaor1993686
Country:	Netherlands
Volume:	12
Issue:	1
Start Page Number:	17
End Page Number:	22
Publication Date:	Jul 1992
Journal:	Operations Research Letters
Authors:	Kamburowski Jerzy
Keywords:	computational analysis, statistics: empirical

Abstract:

The PERT model of a project composed of m activities whose durations are independent random variables with known distributions is considered. An algorithm is presented, for bounding the project duration distribution from below and above in the sense of stochastic convex ordering. When each activity duration is discrete and at most s possible values, the algorithm can be implemented in O(ms²) time.

Reviews

Required fields are marked *. Your email address will not be published.