Is a unit-job shop not easier than identical parallel machines? (Q1392555)

From MaRDI portal
Revision as of 13:28, 28 May 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
Is a unit-job shop not easier than identical parallel machines?
scientific article

    Statements

    Is a unit-job shop not easier than identical parallel machines? (English)
    0 references
    0 references
    28 July 1998
    0 references
    0 references
    identical parallel machines
    0 references
    unit-time operations
    0 references
    polynomial-time reduction
    0 references
    maximum completion time
    0 references
    maximum lateness
    0 references
    total completion time
    0 references
    total tardiness
    0 references
    NP-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references