An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463)

From MaRDI portal
Revision as of 14:36, 31 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
An improved greedy algorithm for stochastic online scheduling on unrelated machines
scientific article

    Statements

    An improved greedy algorithm for stochastic online scheduling on unrelated machines (English)
    0 references
    0 references
    3 March 2023
    0 references
    online scheduling
    0 references
    stochastic scheduling
    0 references
    total weighted completion time
    0 references
    unrelated machines
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers