Pages that link to "Item:Q1200756"
From MaRDI portal
The following pages link to Bounding the distribution of project duration in PERT networks (Q1200756):
Displaying 21 items.
- Computing the throughput of probabilistic and replicated streaming applications (Q472492) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- Bounding the expected time-cost curve for a stochastic PERT network from below (Q1121790) (← links)
- Iterative converging algorithms for computing bounds on durations of activities in pert and pert-like models (Q1411334) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- On the distribution-free newsboy problem with some non-skewed demands (Q1785632) (← links)
- Proposal of a new distribution in PERT methodology (Q2430618) (← links)
- Lower bound for the mean project completion time in dynamic PERT networks (Q2462112) (← links)
- Mixture densities for project management activity times: A robust approach to PERT (Q2470106) (← links)
- Computing the probability distribution of project duration in a PERT network (Q3032046) (← links)
- (Q3149926) (← links)
- Some remarks on the expected delay of project duration in a PERT network (Q3346077) (← links)
- Note sur les problèmes d'ordonnancement PERT aléatoires (Q3686480) (← links)
- (Q3691403) (← links)
- Bounding the Project Completion Time Distribution in PERT Networks (Q3703645) (← links)
- Robustness against dependence in PERT: An application of duality and distributions with known marginals (Q3722254) (← links)
- (Q3740548) (← links)
- On the Distribution of Activity Time in PERT (Q3787781) (← links)
- Computing bounds on project duration distributions for stochastic PERT networks (Q4526866) (← links)
- STUDY ON LONGER AND SHORTER BOUNDARY DURATION VECTORS WITH ARBITRARY DURATION AND COST VALUES (Q5384889) (← links)
- A computational study on bounding the makespan distribution in stochastic project networks (Q5948194) (← links)