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):

Displaying 10 items.

• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities (Q280170) (← links)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
• A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan (Q1632965) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) (← links)
• An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
• Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling (Q2883566) (← links)
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← 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)