An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling (Q4032943)
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: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling |
scientific article; zbMATH DE number 165030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling |
scientific article; zbMATH DE number 165030 |
Statements
An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling (English)
0 references
17 May 1993
0 references
on-line scheduling
0 references
independent jobs
0 references
makespan
0 references
worst case performance
0 references
0.9109290838241576
0 references
0.8768465518951416
0 references
0.865481436252594
0 references
0.865481436252594
0 references
