Complexity of the minimum-dummy-activities problem in a pert network
From MaRDI portal
Publication:3049809
DOI10.1002/net.3230090302zbMath0414.68018OpenAlexW2050783363MaRDI QIDQ3049809
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
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items (8)
Randomized heuristics for exploiting Jacobian scarcity ⋮ Activity nets: A guided tour through some recent developments ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ A new method for constructing a minimal PERT network ⋮ 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 ⋮ On the latest starting times and criticality of activities in a network with imprecise durations ⋮ Optimal constructions of reversible digraphs
This page was built for publication: Complexity of the minimum-dummy-activities problem in a pert network
