Tighter Bounds for LPT Scheduling on Uniform Processors (Q3801059)
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: Tighter Bounds for LPT Scheduling on Uniform Processors |
scientific article; zbMATH DE number 4068263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter Bounds for LPT Scheduling on Uniform Processors |
scientific article; zbMATH DE number 4068263 |
Statements
Tighter Bounds for LPT Scheduling on Uniform Processors (English)
0 references
1987
0 references
multiprocessor scheduling
0 references
worst-case performance
0 references
heuristic algorithms
0 references
uniform processors
0 references
0.9008105993270874
0 references
0.8998914957046509
0 references
0.89239102602005
0 references
0.8920154571533203
0 references
0.8862560987472534
0 references
