Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903)

From MaRDI portal
Revision as of 10:49, 27 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
Polynomial time algorithms for the UET permutation flowshop problem with time delays
scientific article

    Statements

    Polynomial time algorithms for the UET permutation flowshop problem with time delays (English)
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    0 references
    Complexity
    0 references
    makespan
    0 references
    permutation flowshop
    0 references
    scheduling
    0 references
    time delays
    0 references
    0 references