On the complexity of interval scheduling with a resource constraint (Q551193)
From MaRDI portal
!
WARNING
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 5920442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of interval scheduling with a resource constraint |
scientific article; zbMATH DE number 5920442 |
Statements
On the complexity of interval scheduling with a resource constraint (English)
0 references
14 July 2011
0 references
scheduling
0 references
fixed job scheduling
0 references
resource allocation
0 references
complexity
0 references
interval availability
0 references
0 references
0 references
0.8482199907302856
0 references
0.8001953363418579
0 references
0.7916635274887085
0 references
0.7913561463356018
0 references
