The Most Critical Path in a PERT Network

DOI10.1057/JORS.1994.42zbMATH Open0797.90024OpenAlexW2042891879MaRDI QIDQ4287635FDOQ4287635

Hossein M. Soroush

Publication date: 12 April 1994

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1994.42

zbMATH Keywords

optimal path problemproject managementPERTtwo-attribute fractional objective function

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Cited In (6)

• Longest path analysis in networks of queues: dynamic scheduling problems
• Finding the critical path in an activity network with time-switch constraints
• Evaluating project completion time in project networks with discrete random activity durations
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The most critical path in a PERT network: A heuristic approach
• Critical path in an activity network with time constraints

   Recommendations

• The most critical path in a PERT network: A heuristic approach 👍 👎
• Determining the K Most Critical Paths in PERT Networks 👍 👎
• Risk taking in stochastic PERT networks 👍 👎
• A new probabilistic approach to the path criticality in stochastic PERT 👍 👎
• Approximating the Criticality Indices of the Activities in PERT Networks 👍 👎

This page was built for publication: The Most Critical Path in a PERT Network

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