Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940)

From MaRDI portal
Revision as of 03:54, 17 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
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
scientific article

    Statements

    Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (English)
    0 references
    31 October 2018
    0 references
    scheduling
    0 references
    non-permutation flowshop
    0 references
    time lags
    0 references
    mathematical programming
    0 references
    heuristics
    0 references
    lexicographic optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references