New approximation bounds for LPT scheduling (Q2379930)
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: New approximation bounds for LPT scheduling |
scientific article; zbMATH DE number 5686379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approximation bounds for LPT scheduling |
scientific article; zbMATH DE number 5686379 |
Statements
New approximation bounds for LPT scheduling (English)
0 references
23 March 2010
0 references
approximation algorithms
0 references
related machine scheduling
0 references
LPT
0 references
0 references
0 references
0.8970749378204346
0 references
0.887932538986206
0 references
0.8877401351928711
0 references
0.8860153555870056
0 references
0.8811087012290955
0 references
