Pages that link to "Item:Q3064043"
From MaRDI portal
The following pages link to A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043):
Displaying 5 items.
- An effective approach for scheduling coupled activities in development projects (Q319026) (← links)
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
- Simplifying activity networks under generalized precedence relations to extended CPM networks (Q2829161) (← links)
