Pages that link to "Item:Q1060947"

The following pages link to An upper bound on the expected completion time of PERT networks (Q1060947):

Displaying 18 items.

• Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
• A Laplace transform method for order statistics from nonidentical random variables and its application in phase-type distribution (Q553025) (← links)
• Evaluating project completion times when activity times are Weibull distributed (Q703928) (← links)
• Stochastic activity networks with truncated exponential activity times (Q815978) (← links)
• A classified bibliography of recent research relating to project risk management (Q1127233) (← links)
• Critical path in an activity network with time constraints (Q1278077) (← links)
• Estimating the mean completion time of PERT networks with exponentially distributed durations of activities (Q1319548) (← links)
• Finding the critical path in an activity network with time-switch constraints (Q1579499) (← links)
• A new approach to determine the critical path in stochastic activity network (Q1718645) (← links)
• A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
• Game-theoretic modeling of the project management contract (Q2229537) (← links)
• Risk taking in stochastic PERT networks (Q2367367) (← links)
• Adjustment of the moments of the project completion times when activity times are exponentially distributed (Q2430617) (← links)
• Bounds for the expectation of linear combinations of order statistics with application to pert networks (Q3793510) (← links)
• Evaluating the project completion time when activity networks follow beta distribution (Q5164632) (← links)
• (Q5389708) (← links)
• Chance-constrained programming in activity networks: A critical evaluation (Q5935424) (← links)
• The computational complexity of the criticality problems in a network with interval activity times (Q5953342) (← links)