Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046)
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: Approximate algorithms for unrelated machine scheduling to minimize makespan |
scientific article; zbMATH DE number 6497466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate algorithms for unrelated machine scheduling to minimize makespan |
scientific article; zbMATH DE number 6497466 |
Statements
Approximate algorithms for unrelated machine scheduling to minimize makespan (English)
0 references
22 October 2015
0 references
scheduling
0 references
unrelated parallel machine
0 references
approximation algorithm
0 references
linear programming
0 references
rounding
0 references
0 references
0.9391041
0 references
0 references
0.9156595
0 references
0.91293705
0 references
0.9053261
0 references
0.90295327
0 references
0.8986316
0 references
