Pages that link to "Item:Q1935550"

The following pages link to Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550):

Displaying 8 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: a Lagrangian relaxation based lower bound (Q766253) (← links)
• An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
• An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
• A priority based assignment problem (Q2293428) (← links)
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations (Q6534414) (← links)
• Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm (Q6588475) (← links)