Bounding the Project Completion Time Distribution in PERT Networks

DOI10.1287/opre.33.4.862zbMath0579.90055OpenAlexW2168903052MaRDI QIDQ3703645

Bajis Dodin

Publication date: 1985

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

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

zbMATH Keywords

upper boundlower boundsmean completion timeactivity networkrandom activity durationPERT model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (31)

Risk taking in stochastic PERT networks ⋮ A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ Distributionally robust mixed integer linear programs: persistency models with applications ⋮ The most critical path in a PERT network: A heuristic approach ⋮ Resource allocation for a stochastic CPM-type network through perturbation analysis ⋮ Allocating slacks in stochastic PERT network ⋮ Extremal Probability Bounds in Combinatorial Optimization ⋮ An optimization model for stochastic project networks with cash flows ⋮ 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 ⋮ A classified bibliography of recent research relating to project risk management ⋮ Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty ⋮ A new probabilistic approach to the path criticality in stochastic PERT ⋮ Bounding the distribution of project duration in PERT networks ⋮ The exact overall time distribution of a project with uncertain task durations ⋮ On path correlation and PERT bias ⋮ Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative ⋮ Global optima results for the Kauffman \(NK\) model ⋮ On the latest starting times and criticality of activities in a network with imprecise durations ⋮ Stochastic networks and the extreme value distribution ⋮ A review of the contribution of operational research to project management ⋮ A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming ⋮ Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Evaluating project completion time in project networks with discrete random activity durations ⋮ A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems ⋮ Approximating probability density functions and their convolutions using orthogonal polynomials ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops ⋮ Computing latest starting times of activities in interval-valued networks with minimal time lags ⋮ A new structural mechanism for reducibility of stochastic PERT networks ⋮ On latest starting times and floats in activity networks with ill-known durations

This page was built for publication: Bounding the Project Completion Time Distribution in PERT Networks