The following pages link to (Q3426433):
Displaying 19 items.
- 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)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- Lower bounds for resource-constrained project scheduling problems. (Q1399575) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
- A new LP-based lower bound for the cumulative scheduling problem (Q1590042) (← links)
- An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
- Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
- Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
- Tight LP bounds for resource constrained project scheduling (Q1880319) (← links)
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects (Q2117197) (← links)
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (Q2883566) (← links)
- IP-based energetic reasoning for the resource constrained project scheduling problem (Q2883582) (← links)
- THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT (Q3220333) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900297) (← links)
