An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796)

From MaRDI portal
Revision as of 04:41, 3 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 optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
scientific article

    Statements

    An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    analysis of algorithms
    0 references
    semi-online algorithms
    0 references
    single machine scheduling
    0 references
    total weighted completion time
    0 references
    competitive ratio
    0 references
    0 references