Pages that link to "Item:Q766253"

The following pages link to Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253):

Displayed 2 items.

• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) ‎ (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) ‎ (← links)