BOUNDING THE DISTRIBUTION OF PROJECT DURATION IN PERT NETWORKS

被引：14
|
作者：
KAMBUROWSKI, J
机构：
[1] College of Business Administration, Department of Information Systems and Operation Management, University of Toledo, Toledo, OH
来源：
OPERATIONS RESEARCH LETTERS | 1992年 / 12卷 / 01期
关键词：
PERT NETWORK; PROJECT DURATION; BOUNDS; CONVEX ORDERING;
D O I：
10.1016/0167-6377(92)90017-W
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the PERT model of a project composed of m activities whose durations are independent random variables with known distributions. We present an algorithm for bounding the project duration distribution from below and above in the sense of stochastic convex ordering. When each activity duration is discrete with at most s possible values, the algorithm can be implemented in O(ms2) time.
引用
收藏
页码：17 / 22
页数：6
相关论文
共 50 条
12345