The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331)

From MaRDI portal
Revision as of 11:44, 6 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
The complexity of two-job shop problems with multi-purpose unrelated machines.
scientific article

    Statements

    The complexity of two-job shop problems with multi-purpose unrelated machines. (English)
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    0 references
    Shop scheduling
    0 references
    Multi-purpose unrelated machines
    0 references
    Complexity analysis
    0 references