Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596)

From MaRDI portal
Revision as of 14:56, 11 June 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
Permutation flowshop scheduling problems with maximal and minimal time lags
scientific article

    Statements

    Permutation flowshop scheduling problems with maximal and minimal time lags (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    Permutation flowshop
    0 references
    Minimal and maximal time lags
    0 references
    Complexity
    0 references
    Branch and bound
    0 references
    Heuristics
    0 references
    0 references