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.