Pages that link to "Item:Q5948194"
From MaRDI portal
The following pages link to A computational study on bounding the makespan distribution in stochastic project networks (Q5948194):
Displaying 13 items.
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- Stochastic project networks. Temporal analysis, scheduling and cost minimization (Q1202111) (← links)
- Computing project makespan distributions: Markovian PERT networks revisited (Q1634063) (← links)
- Scheduling Markovian PERT networks to maximize the net present value (Q2270324) (← links)
- Project planning with alternative technologies in uncertain environments (Q2630099) (← links)
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
- Bounding the Project Completion Time Distribution in PERT Networks (Q3703645) (← links)
- Computing bounds on project duration distributions for stochastic PERT networks (Q4526866) (← links)
- Stochastic limit laws for schedule makespans (Q4883748) (← links)
- Analysis of the impact of corrective actions for stochastic project networks (Q6565390) (← links)
