Probabilistic PERT
From MaRDI portal
Publication:3208398
DOI10.1147/rd.233.0339zbMath0417.90041OpenAlexW2912022881MaRDI QIDQ3208398
Publication date: 1979
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.233.0339
network flow algorithmproject planningPert networkapplication of convex programmingcomputer hardware designprobabilistic Pert
Extremal problems in graph theory (05C35) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams, Distributionally Robust Linear and Discrete Optimization with Marginals, Polynomial-time algorithms for multimarginal optimal transport problems with structure, Some remarks on the expected delay of project duration in a PERT network, Persistence in discrete optimization under data uncertainty, Critical path in an activity network with time constraints, Finding the critical path in an activity network with time-switch constraints, A compact hash function for paths in PERT networks
