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 16 items.
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← 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)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities (Q2076817) (← 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)
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
- (Q3426433) (← links)
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations (Q3458826) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)