Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (Q3329209)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling |
scientific article |
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
