Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324)

From MaRDI portal
Revision as of 21:09, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
scientific article

    Statements

    Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2000
    0 references
    0 references
    shop-scheduling
    0 references
    polynomial algorithm
    0 references
    NP-hard problem
    0 references