An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886)
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: An efficient approximation algorithm for minimizing makespan on uniformly related machines. |
scientific article; zbMATH DE number 1714184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient approximation algorithm for minimizing makespan on uniformly related machines. |
scientific article; zbMATH DE number 1714184 |
Statements
8 July 2002
0 references
scheduling
0 references
0.9155593
0 references
0.8986316
0 references
0.8880806
0 references
0.8879943
0 references
0.8862029
0 references
0.88593227
0 references
0.88273996
0 references
0.8723819
0 references
An efficient approximation algorithm for minimizing makespan on uniformly related machines. (English)
0 references
