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

heuristicminimum-dummy-activities problemPERT networksproject completion time

Mathematics Subject Classification ID

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

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

(8)

• 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
• scientific article; zbMATH DE number 1234734 (Why is no real title available?)
• scientific article; zbMATH DE number 1517143 (Why is no real title available?)
• New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
• Creating an equivalent multi-phases activity network by adding the least dummy activities
• A new method for constructing a minimal PERT network

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)