Pages that link to "Item:Q4509382"
From MaRDI portal
The following pages link to Minimizing the complexity of an activity network (Q4509382):
Displaying 11 items.
- A new method for constructing a minimal PERT network (Q646227) (← links)
- A path enumeration approach for the analysis of critical activities in fuzzy networks (Q713412) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- On the latest starting times and criticality of activities in a network with imprecise durations (Q988966) (← links)
- On the use of the complexity index as a measure of complexity in activity networks (Q1278225) (← links)
- Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming (Q1764795) (← links)
- Simplifying activity networks under generalized precedence relations to extended CPM networks (Q2829161) (← links)
- On the computational complexity of the minimum-dummy-activities problem in a pert network (Q3332752) (← links)
- Reducing the number of paths in a minimized project-network with given bounds on the durations of activities (Q4575164) (← links)
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (Q6568412) (← links)
