The most critical path in a PERT network: A heuristic approach
From MaRDI portal
Publication:1341990
DOI10.1016/0377-2217(94)90124-4zbMath0814.90028OpenAlexW1975996215MaRDI QIDQ1341990
Publication date: 9 February 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90124-4
heuristicproject managementdeterministic networkmost critical path problemtwo-attribute fractional objective function
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Routing with nonlinear multiattribute cost functions
- The use of cutsets in Monte Carlo analysis of stochastic networks
- The shortest path problem with two objective functions
- Approximating the distribution functions in stochastic networks
- Minimum cost-reliability ratio path problem
- Determining the K Most Critical Paths in PERT Networks
- Bounding the Project Completion Time Distribution in PERT Networks
- A Multivariate Approach to Estimating the Completion Time for PERT Networks
- Some Results Concerning the Estimation of Beta Distribution Parameters in PERT
- On the Distribution of Activity Time in PERT
- Combinatorial Optimization with Rational Objective Functions
- The Completion Time of PERT Networks
- Bounding distributions for a stochastic pert network
- Minimal ratio spanning trees
- Three-Point Approximations for Continuous Random Variables
- Application of a Technique for Research and Development Program Evaluation
- Distribution of the Time Through a Directed, Acyclic Network
- Approximate means and standard deviations based on distances between percentage points of frequency curves
