Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853)

From MaRDI portal
Revision as of 23:13, 15 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
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
scientific article

    Statements

    Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (English)
    0 references
    0 references
    0 references
    15 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    flow-shop
    0 references
    interval processing times
    0 references
    minmax regret
    0 references
    heuristic algorithms
    0 references
    computational experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references