STOCHASTIC PERT NETWORKS - OP DIAGRAMS, CRITICAL PATHS AND THE PROJECT COMPLETION-TIME

被引:24
作者
FISHER, DL
SAISI, D
GOLDSTEIN, WM
机构
[1] SMITH COLL,NORTHAMPTON,MA 01063
[2] UNIV CHICAGO,DEPT BEHAV SCI,CHICAGO,IL 60637
关键词
OPERATIONS RESEARCH - PROBABILITY - Random Processes;
D O I
10.1016/0305-0548(85)90019-X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In many situations the order in which the tasks (jobs or processes) which make up a project must be initiated can be represented in a directed graph known as a PERT (Program Evaluation and Review Technique) network. PERT networks have a useful role to play in the management of complex projects. Recently, closed form expressions for the expectation, variance and distribution of the project completion time in stochastic PERT networks have been derived. In this article closed form expressions were developed for the probability that a particular path in the PERT network was critical.
引用
收藏
页码:471 / 482
页数:12
相关论文
共 14 条
[1]  
Aho A., 1976, DESIGN ANAL COMPUTER
[2]  
DODIN BM, 1981, MAY M OP RES SOC AM
[3]   STOCHASTIC PERT NETWORKS AS MODELS OF COGNITION - DERIVATION OF THE MEAN, VARIANCE, AND DISTRIBUTION OF REACTION-TIME USING ORDER-OF-PROCESSING (OP) DIAGRAMS [J].
FISHER, DL ;
GOLDSTEIN, WM .
JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1983, 27 (02) :121-151
[4]  
FISHER DL, 1983, NOV M OP RES SOC AM
[5]  
FISHER DL, 1981, AUG M SOC MATH PSYCH
[6]   EXPECTED CRITICAL PATH LENGTHS IN PERT NETWORKS [J].
FULKERSON, DR .
OPERATIONS RESEARCH, 1962, 10 (06) :808-817
[7]  
GOLDSTEIN WM, 1983, M OPERATIONS RES SOC
[8]  
Hartley H. O., 1966, MANAGE SCI, V12, pB469
[9]  
KELLEY JE, 1961, OPS RES, V9
[10]  
MALCOLM DG, 1959, OPS RES, V7