BOUNDING THE PROJECT COMPLETION-TIME DISTRIBUTION IN PERT NETWORKS

被引：109

作者：

DODIN, B

机构：

来源：

关键词：

D O I：

10.1287/opre.33.4.862

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：862 / 881

页数：20

共 19 条

BURT, JM ;

GARMAN, MB .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (03) :207-217

[2] MODIFICATION OF FULKERSONS PERT ALGORITHM [J].

CLINGEN, CT .

[3]

DEVROYE LP, 1980, MATH OPER RES, V4, P441

[4]

DODIN BM, 1985, COMPUT OPNS RES, V12

[5]

DODIN BM, 1985, OMEGA, V13

[6]

Elmaghraby SE, 1967, MANAGE SCI, V13, P299, DOI DOI 10.1287/MNSC.13.5.299

[7]

ELMAGHRABY SE, 1977, ACTIVITY NETWORKS PR

[8] ASSOCIATION OF RANDOM VARIABLES WITH APPLICATIONS [J].

ESARY, JD ;

PROSCHAN, F ;

WALKUP, DW .

ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (05) :1466-&

[9] EXPECTED CRITICAL PATH LENGTHS IN PERT NETWORKS [J].

FULKERSON, DR .

[10]

Hartley H.O., 1996, MANAGE SCI, V12, pB391, DOI 10.1287/mnsc.12.10.B469