The exact LPT-bound for maximizing the minimum completion time (Q1196214)
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: The exact LPT-bound for maximizing the minimum completion time |
scientific article; zbMATH DE number 77896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The exact LPT-bound for maximizing the minimum completion time |
scientific article; zbMATH DE number 77896 |
Statements
The exact LPT-bound for maximizing the minimum completion time (English)
0 references
17 December 1992
0 references
suboptimal algorithms
0 references
identical processors
0 references
worst case ratio
0 references
