본문 바로가기
KERD
논문

PERT 요소공정의 주경로 확률 산정 모델 개발

Development Model for Estimating Critical Path Probability of Element Path in PERT

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류농학

초록

The PERT is one form of probabilistic network and can have many critical paths in the concept of each work has dispersed complete time. Here we propose two operators to estimate the probabilistic complete time about serial and parallel connections, and in each junction node, probability of critical path is estimated by new operator. Then we compare the estimated results with robability of critical path with deterministic CPM and Monte Carlo simulation (MCS). Our results show that all paths in PERT can be critical path, and proposed operators are efficient and accurate probabilistic calculators compare MCS result.

Abstract

The PERT is one form of probabilistic network and can have many critical paths in the concept of each work has dispersed complete time. Here we propose two operators to estimate the probabilistic complete time about serial and parallel connections, and in each junction node, probability of critical path is estimated by new operator. Then we compare the estimated results with robability of critical path with deterministic CPM and Monte Carlo simulation (MCS). Our results show that all paths in PERT can be critical path, and proposed operators are efficient and accurate probabilistic calculators compare MCS result.

참고문헌 (23)

  1. Burt, J. M. Jr., "Monte Carlo techniques for stochastic network analysis", In Winter Simulation Conference, 통권 : 9, pp.146~153 (1970), IEEE
  2. Burt, J. M., "Conditional Monte Carlo: A simulation technique for stochastic network analysis", In Management Science, 8(3), pp.207~217 (1971)
  3. Chen, S., "Finding multiple possible critical path using fuzzy PERT", In Institute of Electrical and Electronics Engineers, 31(6), pp.930~937 (2001)
  4. Chen, Y., "Critical path in an activity network with time constraints", In European Journal of Operational Research, 100(1), pp.122~133 (1997)
  5. Dodin, B., "Determining the K most critical paths in PERT networks", In Operator Research Society of America, 21(4), pp.859~877 (1984)
  6. Dodin, B., "Approximating the distribution functions in stochastic networks", In Computer and Operation Research, 12(3), pp.251~264 (1985)
  7. Dodin, B., "Stochastic networks and the extreme value distribution", In Computer and Operation Research, 17(4), pp.397~409 (1990)
  8. Elmaghraby S. E., "On criticality and sensitivity in activity networks", In European Journal of Operational Research, 127(2), pp.220~238 (2000)
  9. Fatemi Ghomi, S. M. T., "Path critical index and activity critical index in PERT networks", In European Journal of Operational Research, 141(1), pp.147~152 (2001)
  10. Fulkerson, D. R., "Expected critical path length in PERT networks", In Operations research, 10(6), pp.808~817 (1962)
  11. Gong, D., "Calculation of safe float use in risk-analysis-oriented network scheduling", In International Journal of Project Management, 13(3), pp.187~194 (1995)
  12. Lee, J., "An investigation of project completion time estimation method in PERT network for planning and management in large-scale systems", In Proc. of the Korean Society of Agricultural Engineerings Conference, pp.695~699 (2005)
  13. Liang G., "Fuzzy critical path for project network", In Information and Management Science, 15(4), pp.29~40 (2004)
  14. Malcom, D. G., "Application of a technique for research and development program Evaluation", In Operations Research, 7(5), pp.646~669 (1959)
  15. Ringer, L. J., "Numerical operators for statistical PERT critical path analysis", In Management Science, 16(2), pp.136~143 (1969)
  16. Ringer, L. J., "A statistical theory for PERT in which completion times of activities are inter-dependent", Management Science, 17(11), pp.717~723 (1971)
  17. Robillard, P., "The completion time of PERT networks", In Operations Research, 25(1), pp.15~29 (1977)
  18. Sigal, C. E., "The use of cutsets in Monte Calros analysis of stochastic network", In Mathematic and Computers in Simulation, 21(4), pp.376~384 (1979)
  19. Soroush H. M., "The most critical path in a PERT network", In Operational Research Society, 45(3), pp.287~300 (1994)
  20. Van Slyke, R. M., "Monte Carlo method and the PERT problem", In Operations Research and the Management Sciences, 11(5), pp.839~860 (1963)
  21. Williams T. M., "Criticality in stochastic networks", In Operational Research Society, 43(4), pp.353~357 (1992)
  22. Yang, H., "Finding the critical path in an activity network with time-switch constraints", In European Journal of Operational Research, 120, pp.603~613 (2000)
  23. Yao, M., "A new approximation algorithm for obtaining the probability distribution function for project complement time", In Computers and Mathematics with Applications, 54(2), pp.282~295 (2007)

관련 논문AI추천

이 간행물의 다른 논문 (8건)