A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
From MaRDI portal
Publication:1370565
Recommendations
- A new method for constructing a minimal PERT network
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- scientific article; zbMATH DE number 1234734
- New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
- The minimum dummy task problem
Cited in
(7)- On the computational complexity of the minimum-dummy-activities problem in a pert network
- A note on minimum-dummy-activities PERT networks
- The minimum dummy task problem
- New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
- A new method for constructing a minimal PERT network
- scientific article; zbMATH DE number 1517143 (Why is no real title available?)
- Creating an equivalent multi-phases activity network by adding the least dummy activities
This page was built for publication: A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370565)