Approximation schemes for scheduling on parallel machines (Q1268852)
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 1216810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation schemes for scheduling on parallel machines |
scientific article; zbMATH DE number 1216810 |
Statements
Approximation schemes for scheduling on parallel machines (English)
0 references
1 November 1998
0 references
scheduling theory
0 references
approximation algorithm
0 references
worst-case ratio
0 references
combinatorial optimization
0 references
machine completion times
0 references
polynomial-time approximation scheme
0 references
0.8906519412994385
0 references
0.8883645534515381
0 references
0.8822312951087952
0 references
0.8712996244430542
0 references
