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

From MaRDI portal
Revision as of 02:37, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers