A general lower bound for the makespan problem (Q1266724)

From MaRDI portal
Revision as of 19:26, 17 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
A general lower bound for the makespan problem
scientific article

    Statements

    A general lower bound for the makespan problem (English)
    0 references
    0 references
    7 October 1998
    0 references
    identical parallel processors
    0 references
    makespan
    0 references
    NP-hard
    0 references
    lower bound
    0 references

    Identifiers