Pages that link to "Item:Q3818784"
From MaRDI portal
The following pages link to A New Approach to the Activity-time Distribution in PERT (Q3818784):
Displaying 27 items.
- Allocating slacks in stochastic PERT network (Q301152) (← links)
- Evaluating project completion times when activity times are Weibull distributed (Q703928) (← links)
- An adaptive parallel algorithm for analyzing activity networks (Q910339) (← links)
- A classified bibliography of recent research relating to project risk management (Q1127233) (← links)
- A proposal on improved procedures for estimating task-time distributions in PERT (Q1127234) (← links)
- Iterative converging algorithms for computing bounds on durations of activities in pert and pert-like models (Q1411334) (← links)
- Fuzzy-probabilistic PERT (Q1686504) (← links)
- How adding new information modifies the estimation of the mean and the variance in PERT: a maximum entropy distribution approach (Q1730716) (← links)
- Finding the distribution density of the time taken to fulfill the GERT network on the basis of equivalent simplifying transformations (Q1778844) (← links)
- Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation (Q1805493) (← links)
- A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
- Analysis of the stable laws of distribution of the duration of operations in the stochastic network projects (Q1881991) (← links)
- Adjustment of the moments of the project completion times when activity times are exponentially distributed (Q2430617) (← links)
- Proposal of a new distribution in PERT methodology (Q2430618) (← links)
- A new approximation algorithm for obtaining the probability distribution function for project completion time (Q2460585) (← links)
- A rule for slack allocation proportional to the duration in a PERT network (Q2463507) (← links)
- Mixture densities for project management activity times: A robust approach to PERT (Q2470106) (← links)
- A representation model for the solving-time distribution of a set of design tasks in new product development (NPD) (Q2482796) (← links)
- Preprocessing stochastic shortest-path problems with application to PERT activity networks (Q2899138) (← links)
- COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS (Q3026722) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- Efficient sensitivity analysis of PERT network performance measures to significant changes in activity time parameters (Q3512384) (← links)
- (Q3577412) (← links)
- On the Distribution of Activity Time in PERT (Q3787781) (← links)
- A Simple Approximation to the Completion Time Distribution for a PERT Network (Q3984312) (← links)
- Evaluating the project completion time when activity networks follow beta distribution (Q5164632) (← links)
- The generalized two-sided beta distribution with applications in project risk analysis (Q6172246) (← links)
