A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519)
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: A polynomial-time approximation scheme for maximizing the minimum machine completion time |
scientific article; zbMATH DE number 1043998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time approximation scheme for maximizing the minimum machine completion time |
scientific article; zbMATH DE number 1043998 |
Statements
A polynomial-time approximation scheme for maximizing the minimum machine completion time (English)
0 references
5 August 1997
0 references
identical parallel machines
0 references
worst case ratio
0 references
polynomial-time approximation scheme
0 references
0.9038335
0 references
0.90001625
0 references
0.8940909
0 references
0.8940725
0 references
0.8903713
0 references
0.8890438
0 references
0.88903034
0 references
0.88787663
0 references
0.88758713
0 references
