A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003)
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 new approximation algorithm for unrelated parallel machine scheduling with release dates |
scientific article; zbMATH DE number 7153671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approximation algorithm for unrelated parallel machine scheduling with release dates |
scientific article; zbMATH DE number 7153671 |
Statements
A new approximation algorithm for unrelated parallel machine scheduling with release dates (English)
0 references
20 January 2020
0 references
unrelated parallel machine scheduling
0 references
release dates
0 references
semi-definite programming
0 references
approximation algorithm
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8436715602874756
0 references
0.8192691802978516
0 references
0.8129777312278748
0 references
0.8129110932350159
0 references
