Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 14601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter bound for MULTIFIT scheduling on uniform processors |
scientific article; zbMATH DE number 14601 |
Statements
Tighter bound for MULTIFIT scheduling on uniform processors (English)
0 references
25 June 1992
0 references
heuristic algorithms
0 references
uniform-processor
0 references
bin packing
0 references
multiprocessor scheduling
0 references
worst-case analysis
0 references
0.9299712181091307
0 references
0.917878031730652
0 references
0.9053713083267212
0 references
0.8862560987472534
0 references
