On the exact upper bound for the Multifit processor scheduling algorithm (Q920838)

From MaRDI portal
Revision as of 11:53, 7 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
On the exact upper bound for the Multifit processor scheduling algorithm
scientific article

    Statements

    On the exact upper bound for the Multifit processor scheduling algorithm (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    exact upper bound
    0 references
    independent tasks
    0 references
    identical processors
    0 references
    makespan
    0 references
    Multifit
    0 references