Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems |
scientific article; zbMATH DE number 842095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems |
scientific article; zbMATH DE number 842095 |
Statements
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (English)
0 references
6 February 1996
0 references
\({\mathcal N} {\mathcal P}\)-hard combinatorial optimization
0 references
Lagrangian relaxation
0 references
machine scheduling
0 references
Lagrangian bounds
0 references
total weighted completion time
0 references
precedence constraints
0 references
two-machine flow-shop
0 references
