Pages that link to "Item:Q1906070"

The following pages link to Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070):

Displaying 5 items.

• Flow shop non-idle scheduling and resource-constrained scheduling (Q271983) (← links)
• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)