Estimating the makespan of the two-valued restricted assignment problem (Q5369526)
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: Estimating the makespan of the two-valued restricted assignment problem |
scientific article; zbMATH DE number 6792400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the makespan of the two-valued restricted assignment problem |
scientific article; zbMATH DE number 6792400 |
Statements
17 October 2017
0 references
unrelated scheduling
0 references
restricted assignment
0 references
configuration LP
0 references
integrality gap
0 references
estimation algorithm
0 references
Estimating The Makespan of The Two-Valued Restricted Assignment Problem (English)
0 references
0.9918470978736876
0 references
0.8805698752403259
0 references
0.8294619917869568
0 references
0.8169310688972473
0 references
