Tighter approximation bounds for LPT scheduling in two special cases (Q1026246)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter approximation bounds for LPT scheduling in two special cases |
scientific article |
Statements
Tighter approximation bounds for LPT scheduling in two special cases (English)
0 references
24 June 2009
0 references
approximation algorithms
0 references
related machine scheduling
0 references
LPT
0 references
scheduling mechanisms
0 references
monotone algorithms
0 references
0 references
0 references
