Probabilistic PERT

DOI10.1147/RD.233.0339MaRDI QIDQ3208398zbMATH OpenOpenAlexFDO

Authors Arthur Nádas

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

zbMATH Keywords

network flow algorithmproject planningPert networkapplication of convex programmingcomputer hardware designprobabilistic Pert

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35)

Cited in

(8)

• Polynomial-time algorithms for multimarginal optimal transport problems with structure
• Some remarks on the expected delay of project duration in a PERT network
• Finding the critical path in an activity network with time-switch constraints
• Distributionally Robust Linear and Discrete Optimization with Marginals
• Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
• A compact hash function for paths in PERT networks
• Persistence in discrete optimization under data uncertainty
• Critical path in an activity network with time constraints

This page was built for publication: Probabilistic PERT

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