Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Hoogeveen, J. A. / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Steef L. van de Velde / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems |
scientific article |
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
