A compact hash function for paths in PERT networks

DOI10.1016/0167-6377(84)90005-1zbMath0544.90096OpenAlexW2073285986MaRDI QIDQ797503

Vidyadhar G. Kulkarni

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90005-1

zbMATH Keywords

stochastic networksPERT networkshash functiondirected acyclic networkone sinkone source

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• GERT networks and the time-oriented evaluation of projects
• Probabilistic PERT
• Calculating bounds on reachability and connectedness in stochastic networks
• Estimating critical path and arc probabilities in stochastic activity networks
• The Stochastic Shortest Route Problem