Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647)

From MaRDI portal
Revision as of 14:03, 19 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
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
scientific article

    Statements

    Exact and approximation algorithms for makespan minimization on unrelated parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    10 August 1997
    0 references
    0 references
    NP-hard problem
    0 references
    scheduling
    0 references