Pages that link to "Item:Q646227"
From MaRDI portal
The following pages link to A new method for constructing a minimal PERT network (Q646227):
Displaying 9 items.
- Solution of interval PERT/CPM network problems by a simplified tabular method (Q505096) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities (Q1370565) (← links)
- A distributionally robust analysis of the program evaluation and review technique (Q2030655) (← links)
- On the computational complexity of the minimum-dummy-activities problem in a pert network (Q3332752) (← links)
- A note on minimum-dummy-activities PERT networks (Q3343802) (← links)
- The minimum dummy task problem (Q3787785) (← links)
- Minimizing the complexity of an activity network (Q4509382) (← links)
- Свойства графов задач сетевого планирования и управления (Q5221812) (← links)