Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164)

From MaRDI portal
Revision as of 15:05, 29 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
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
scientific article

    Statements

    Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (English)
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    parallel-batch machines
    0 references
    maximum flow-time
    0 references
    competitive ratio
    0 references

    Identifiers