Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (Q3329209)
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 3860874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling |
scientific article; zbMATH DE number 3860874 |
Statements
Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (English)
0 references
1984
0 references
asymptotic behavior
0 references
completion time minimization
0 references
partitioning problem
0 references
parallel identical processors
0 references
upper bounds
0 references
heuristics
0 references
probabilistic analysis
0 references
absolute deviation
0 references
0.8451642990112305
0 references
0.8248117566108704
0 references
0.8245235085487366
0 references
0.8232113718986511
0 references
0.8220465779304504
0 references
