Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962)
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: Comparing the minimum completion times of two longest-first scheduling-heuristics |
scientific article; zbMATH DE number 6599394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing the minimum completion times of two longest-first scheduling-heuristics |
scientific article; zbMATH DE number 6599394 |
Statements
Comparing the minimum completion times of two longest-first scheduling-heuristics (English)
0 references
29 June 2016
0 references
scheduling
0 references
identical parallel machines
0 references
heuristics
0 references
minimum completion time
0 references
worst-case analysis
0 references
0.8481214046478271
0 references
0.8393850922584534
0 references
0.8198375701904297
0 references
0.8150025010108948
0 references
0.8139841556549072
0 references
