Pages that link to "Item:Q709101"
From MaRDI portal
The following pages link to A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101):
Displaying 6 items.
- 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)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
- Simplifying activity networks under generalized precedence relations to extended CPM networks (Q2829161) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
