Online scheduling of incompatible unit-length job families with lookahead (Q2250449)

From MaRDI portal
Revision as of 05:57, 2 August 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 of incompatible unit-length job families with lookahead
scientific article

    Statements

    Online scheduling of incompatible unit-length job families with lookahead (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    0 references
    online algorithm
    0 references
    parallel-batch scheduling
    0 references
    incompatible job families
    0 references
    makespan
    0 references
    competitive ratio
    0 references