A tight lower bound for job scheduling with cancellation (Q1044744)

From MaRDI portal
Revision as of 22:57, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1288472)
scientific article
Language Label Description Also known as
English
A tight lower bound for job scheduling with cancellation
scientific article

    Statements

    A tight lower bound for job scheduling with cancellation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    on-line algorithms
    0 references
    scheduling
    0 references
    lower bounds
    0 references