A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914)

From MaRDI portal
Revision as of 22:45, 12 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
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
scientific article

    Statements

    A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (English)
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel machine
    0 references
    competitive ratio
    0 references
    total weighted completion time
    0 references
    instance reduction
    0 references
    0 references