A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" (Q4337646)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" |
scientific article; zbMATH DE number 1012883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
26 May 1997
0 references
combinatorial problems
0 references
scheduling
0 references
worst-case bounds
0 references
on-line algorithms
0 references
