Bounding Distributions for a Stochastic Acyclic Network

From MaRDI portal
Publication:5661692

DOI10.1287/opre.19.7.1586zbMath0247.90026OpenAlexW2072725536MaRDI QIDQ5661692

George B. Kleindorfer

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1287/opre.19.7.1586



Related Items

Approximating the distribution functions in stochastic networks, Risk taking in stochastic PERT networks, Distributionally robust mixed integer linear programs: persistency models with applications, Extremal Probability Bounds in Combinatorial Optimization, Probabilistic shortest path problems with budgetary constraints, An optimization model for stochastic project networks with cash flows, Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams, Algebraic methods applied to shortest path and maximum flow problems in stochastic networks, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, Bounding the expected time-cost curve for a stochastic PERT network from below, A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network, Stochastic activity networks: a four-parameter approach for completion times, Adjustment of the moments of the project completion times when activity times are exponentially distributed, Criticality analysis of activity networks under interval uncertainty, A factoring approach for the stochastic shortest path problem, The exact overall time distribution of a project with uncertain task durations, Persistence in discrete optimization under data uncertainty, Stochastic networks and the extreme value distribution, Resource-constrained project scheduling: Notation, classification, models, and methods, An approximate solution to the PERT problem, A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems, Stochastic and fuzzy PERT, On criticality and sensitivity in activity networks, Improving project cost estimation by taking into account managerial flexibility, An upper bound on the expected completion time of PERT networks, A new structural mechanism for reducibility of stochastic PERT networks