Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792)

From MaRDI portal
Revision as of 11:20, 15 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
Tighter bound for MULTIFIT scheduling on uniform processors
scientific article

    Statements

    Tighter bound for MULTIFIT scheduling on uniform processors (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristic algorithms
    0 references
    uniform-processor
    0 references
    bin packing
    0 references
    multiprocessor scheduling
    0 references
    worst-case analysis
    0 references