A note on minimum-dummy-activities PERT networks
DOI10.1051/RO/1984180404151zbMATH Open0551.90094OpenAlexW2470247598MaRDI QIDQ3343802FDOQ3343802
Authors: Marian Mrozek 
Publication date: 1984
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104864
Recommendations
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
- A new method for constructing a minimal PERT network
- scientific article; zbMATH DE number 1859346
- New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
- Two-point approximations for activity times in PERT networks
- Approximating the Criticality Indices of the Activities in PERT Networks
- scientific article; zbMATH DE number 1234734
- Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
- An upper bound on the expected completion time of PERT networks
network analysispolynomial time algorithmnetwork constructionPERT networkssuboptimal algorithmsarc-dual digraphminimum-dummy- activities problemoptimality verification method
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
This page was built for publication: A note on minimum-dummy-activities PERT networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343802)
