Pages that link to "Item:Q439614"
From MaRDI portal
The following pages link to An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614):
Displaying 7 items.
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities (Q280170) (← links)
- An effective approach for scheduling coupled activities in development projects (Q319026) (← links)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints (Q2197158) (← links)
- An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- Resource leveling in projects with flexible structures (Q6099408) (← links)
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times (Q6109310) (← links)