Solving makespan minimization problems with Lagrangean decomposition (Q1209146)

From MaRDI portal
Revision as of 16:33, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving makespan minimization problems with Lagrangean decomposition
scientific article

    Statements

    Solving makespan minimization problems with Lagrangean decomposition (English)
    0 references
    0 references
    16 May 1993
    0 references
    0 references
    makespan
    0 references
    single stage manufacturing process
    0 references
    parallel machines
    0 references
    multiple job types
    0 references
    plant location
    0 references
    constrained 0-1 knapsack problems
    0 references
    Lagrangean dual bound
    0 references