Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320)

From MaRDI portal
Revision as of 14:12, 5 July 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
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
scientific article

    Statements

    Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    combinatorial optimization
    0 references
    scheduling
    0 references
    approximation
    0 references
    robust optimization
    0 references
    flow shop
    0 references
    0 references
    0 references
    0 references
    0 references