Approximating completion time distribution function for stochastic PERT networks

被引：0

作者：

Ghomi, SMTF ^{[1
]}

Rabbani, M

机构：

[1] Amir Kabir Univ Technol, Dept Ind Engn, Tehran, Iran

[2] Univ Tehran, Fac Engn, Tehran, Iran

来源：

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY | 2002年 / 26卷 / B1期

关键词：

PERT; stochastic networks; approximation; distribution function; completion time; renewal process;

D O I：

暂无

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

In this paper an approach to approximate completion time distribution function (CTDF) for stochastic PERT networks is presented. This approach is made with most critical path (MCP) definition and a renewal process. In some cases., the results of this approach is better than Soroush's algorithm that uses only MCP for computation of CTDF. Numerical examples are given and conclusions are made.

引用

页码：107 / 110

页数：4

共 50 条

[21] ON THE DISTRIBUTION OF ACTIVITY TIME IN PERT
GOLENKOGINZBURG, D
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (08) : 767 - 771
[22] RISK-TAKING IN STOCHASTIC PERT NETWORKS
SOROUSH, H
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 67 (02) : 221 - 241
[23] BOUNDING DISTRIBUTIONS FOR STOCHASTIC SHORTEST ROUTE AND STOCHASTIC PERT NETWORKS
SHOGAN, AW
[J]. OPERATIONS RESEARCH, 1975, 23 : B363 - B363
[24] Indices to Critical Activities in Stochastic PERT Networks
Nakade, K.
Narumi, T.
[J]. 2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2015, : 666 - 670
[25] Approximate evaluation of the project completion time of stochastic activity networks
Calquin, Juan M.
Vallejos, Reinaldo C.
Olavarria, Jonathan M.
[J]. PROCEEDINGS OF THE 2016 35TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2016,
[26] THE PERT MODEL FOR THE DISTRIBUTION OF AN ACTIVITY TIME
CLARK, CE
[J]. OPERATIONS RESEARCH, 1962, 10 (03) : 405 - 406
[27] THE BIAS OF AN ESTIMATE OF COUPLED SLACK IN STOCHASTIC PERT NETWORKS
SCHWEICKERT, R
[J]. JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1982, 26 (01) : 1 - 12
[28] A new structural mechanism for reducibility of stochastic PERT networks
Ghomi, SMTF
Rabbani, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 145 (02) : 394 - 402
[29] Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
Ando, Ei
Nakata, Toshio
Yamashita, Masafumi
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 420 - 438
[30] A hierarchical approach for bounding the completion time distribution of stochastic task graphs
Colajanni, M
Lo Presti, F
Tucci, S
[J]. PERFORMANCE EVALUATION, 2000, 41 (01) : 1 - 22

← 1 2 3 4 5 →