Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456)

From MaRDI portal
Revision as of 14:38, 1 July 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
Preemptive scheduling on uniform machines to minimize mean flow time
scientific article

    Statements

    Preemptive scheduling on uniform machines to minimize mean flow time (English)
    0 references
    0 references
    0 references
    19 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel uniform machines
    0 references
    linear programming
    0 references
    maximum flow
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references