A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities

MaRDI QIDQ1370565zbMATH OpenFDO

Authors Omprakash K. Gupta

Publication date 26 October 1997

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

heuristicPERT networksminimum-dummy-activities problemproject completion time

Mathematics Subject Classification ID

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

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)