Pages that link to "Item:Q1145062"
From MaRDI portal
The following pages link to On the measurement of complexity in activity networks (Q1145062):
Displaying 21 items.
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
- A new method for constructing a minimal PERT network (Q646227) (← links)
- Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- A random generator of resource-constrained multi-project network problems (Q964864) (← links)
- On the characterization and generation of nurse scheduling problem instances (Q1027526) (← links)
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
- Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
- On the use of the complexity index as a measure of complexity in activity networks (Q1278225) (← links)
- Optimal resource leveling using non-serial dynamic programming (Q1341995) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs (Q1631504) (← links)
- New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← links)
- An evaluation of the adequacy of project network generators with systematically sampled networks (Q2463502) (← links)
- Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)
- An analysis of network and resource indicators for resource-constrained project scheduling problem instances (Q2668709) (← links)
- Continuous-time formulations for multi-mode project scheduling (Q6164343) (← links)