An upper bound on the expected completion time of PERT networks-Reference-Cited by-同舟云学术

An upper bound on the expected completion time of PERT networks

Published:1985-08 Issue:2 Volume:21 Page:206-212
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kamburowski Jerzy

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference12 articles.

1. Statistical Theory of Reliability and Life Testing;Barlow,1975

2. The greatest of a finite set of random variables;Clark;Operations Research,1961

3. Inequalities for the completion times of stochastic PERT networks;Devroye;Mathematics of Operations Research,1979

4. On the expected duration of PERT type networks;Elmaghraby;Management Science,1967

5. Activity Networks: Project Planning and Control by Networks Models;Elmaghraby,1977

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Game-Theoretic Modeling of the Project Management Contract;Automation and Remote Control;2020-11

2. Evaluating the project completion time when activity networks follow beta distribution;Asian-European Journal of Mathematics;2020-09-11

3. Evaluating the Project Completion Time When Non-Identical Beta Distributions Govern the Activity Networks;American Journal of Mathematical and Management Sciences;2020-09-01

4. A Bounding Technique for Probabilistic PERT;Lecture Notes in Business Information Processing;2019

5. How Robust Is Your Project? From Local Failures to Global Catastrophes: A Complex Networks Approach to Project Systemic Risk;PLOS ONE;2015-11-25