Complexity of the minimum-dummy-activities problem in a pert network

DOI10.1002/NET.3230090302MaRDI QIDQ3049809zbMATHOpenAlexFDO

Authors Narsingh Deo, Mukkai S. Krishnamoorthy

Publication date 1979

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230090302

zbMATH Keywords

computational complexityNp-completePert networkminimum-dummy-activities problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Cited in

(8)

• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• A path enumeration approach for the analysis of critical activities in fuzzy networks
• Optimal constructions of reversible digraphs
• Randomized heuristics for exploiting Jacobian scarcity
• On the latest starting times and criticality of activities in a network with imprecise durations
• Activity nets: A guided tour through some recent developments
• A new method for constructing a minimal PERT network

This page was built for publication: Complexity of the minimum-dummy-activities problem in a pert network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3049809)