Pages that link to "Item:Q3703645"

The following pages link to Bounding the Project Completion Time Distribution in PERT Networks (Q3703645):

Displaying 31 items.

• Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
• Allocating slacks in stochastic PERT network (Q301152) (← links)
• A new probabilistic approach to the path criticality in stochastic PERT (Q441034) (← links)
• Stochastic networks and the extreme value distribution (Q584063) (← links)
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
• An optimization model for stochastic project networks with cash flows (Q867428) (← links)
• On the latest starting times and criticality of activities in a network with imprecise durations (Q988966) (← links)
• Evaluating project completion time in project networks with discrete random activity durations (Q1017440) (← links)
• Computing latest starting times of activities in interval-valued networks with minimal time lags (Q1044116) (← links)
• A classified bibliography of recent research relating to project risk management (Q1127233) (← links)
• Bounding the distribution of project duration in PERT networks (Q1200756) (← links)
• Approximating probability density functions and their convolutions using orthogonal polynomials (Q1278378) (← links)
• The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
• Resource allocation for a stochastic CPM-type network through perturbation analysis (Q1342063) (← links)
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
• Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation (Q1805493) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
• On latest starting times and floats in activity networks with ill-known durations (Q1869710) (← links)
• Solving linear programs with multiple right-hand sides: Pricing and ordering schemes (Q1918430) (← links)
• Risk taking in stochastic PERT networks (Q2367367) (← links)
• On path correlation and PERT bias (Q2482795) (← links)
• Global optima results for the Kauffman \(NK\) model (Q2490339) (← links)
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865) (← links)
• Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty (Q2957465) (← links)
• A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
• Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative (Q4929163) (← links)
• Extremal Probability Bounds in Combinatorial Optimization (Q5051383) (← links)
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks (Q5326783) (← links)
• The exact overall time distribution of a project with uncertain task durations (Q5928451) (← links)
• A review of the contribution of operational research to project management (Q5955087) (← links)