Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979)

From MaRDI portal
Revision as of 19:43, 7 June 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
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
scientific article

    Statements

    Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (English)
    0 references
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Analysis of algorithm
    0 references
    Scheduling
    0 references
    Semi-online
    0 references
    Competitive ratio
    0 references
    0 references