Approximating the discrete resource sharing scheduling problem (Q2997925)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5886162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the discrete resource sharing scheduling problem |
scientific article; zbMATH DE number 5886162 |
Statements
APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (English)
0 references
10 May 2011
0 references
resource allocation
0 references
combining algorithms
0 references
approximation schemes
0 references
oracle-guess approximation
0 references
SAT solver
0 references
0 references
0.795184314250946
0 references
0.7538448572158813
0 references
0.7282596230506897
0 references
0.7275663018226624
0 references
0.7267611622810364
0 references
