Bounding the Project Completion Time Distribution in PERT Networks
Article Abstract:
PERT networks are often used as models in project planning and control. A problem in PERT networks is determining the distribution function of a project's completion time. Where activity durations are completely independent, a method is presented that gives a probability distribution function that bounds the precise probability distribution from below. This may be used to find an upper bound on the mean project completion time. This distribution is tigher than any of the existing lower bounds, which implies that the corresponding upper bound is tighter than any existing upper bound. Diagrams illustrate the network, the forbidden graph, and the Duplication Process.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
Minimizing Flow Time on Parallel Identical Processors With Variable Unit Processing Time
Article Abstract:
The shortest processing time (SPT) schedule is optimal when unit processing of identical machines is a nonincreasing function of the length of the resource already processed. Applications include a learning process from machine operators. Performance improves with experience. Diagrams illustrate concepts.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Randomization Procedures in the Computation of Cumulative-Time Distributions Over Discrete Stare Markov Process
- Abstracts: A Mathematical Programming Model for the Location of Access Controls in a Distributed Data Base Environment. Development Planning and Management of Petroleum Reservoirs Using Tank Models and Nonlinear Programming