The most critical path in a PERT network: A heuristic approach

DOI10.1016/0377-2217(94)90124-4MaRDI QIDQ1341990zbMATH OpenOpenAlexFDO

Authors Hossein M. Soroush

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

zbMATH Keywords

heuristicproject managementdeterministic networkmost critical path problemtwo-attribute fractional objective function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic network models in operations research (90B15)

Recommendations

• The Most Critical Path in a PERT Network
• Determining the K Most Critical Paths in PERT Networks
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• A new probabilistic approach to the path criticality in stochastic PERT
• Risk taking in stochastic PERT networks

Cites work

• scientific article; zbMATH DE number 3819489 (Why is no real title available?)
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• scientific article; zbMATH DE number 3302125 (Why is no real title available?)
• scientific article; zbMATH DE number 3334757 (Why is no real title available?)
• scientific article; zbMATH DE number 3373520 (Why is no real title available?)
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• A note on two problems in connexion with graphs
• Application of a technique for research and development program evaluation
• Approximate means and standard deviations based on distances between percentage points of frequency curves
• Approximating the distribution functions in stochastic networks
• Bounding distributions for a stochastic pert network
• Bounding the Project Completion Time Distribution in PERT Networks
• Combinatorial Optimization with Rational Objective Functions
• Determining the K Most Critical Paths in PERT Networks
• Distribution of the Time Through a Directed, Acyclic Network
• Minimal ratio spanning trees
• Minimum cost-reliability ratio path problem
• On the Distribution of Activity Time in PERT
• Routing with nonlinear multiattribute cost functions
• Some Results Concerning the Estimation of Beta Distribution Parameters in PERT
• The Completion Time of PERT Networks
• The shortest path problem with two objective functions
• The use of cutsets in Monte Carlo analysis of stochastic networks
• Three-Point Approximations for Continuous Random Variables

Cited in

(3)

• Maximum probabilistic all-or-nothing paths
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• The Most Critical Path in a PERT Network

Describes a project that uses

Uses Software

• GASP IV

This page was built for publication: The most critical path in a PERT network: A heuristic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341990)