A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
From MaRDI portal
Publication:1370565
zbMATH Open0879.90092MaRDI QIDQ1370565FDOQ1370565
Authors: Omprakash K. Gupta
Publication date: 26 October 1997
Published in: Opsearch (Search for Journal in Brave)
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
Deterministic scheduling theory in operations research (90B35) Stochastic network models in operations research (90B15)
Cited In (5)
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)