A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" (Q4337646)

From MaRDI portal
Revision as of 11:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1012883
Language Label Description Also known as
English
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
scientific article; zbMATH DE number 1012883

    Statements

    A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 1997
    0 references
    0 references
    combinatorial problems
    0 references
    scheduling
    0 references
    worst-case bounds
    0 references
    on-line algorithms
    0 references
    0 references