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 16 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)
• A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
• A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints (Q1572969) (← links)
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q4645936) (← links)
• Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)