Approximability of scheduling problems with resource consuming jobs (Q256641)
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 6553002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of scheduling problems with resource consuming jobs |
scientific article; zbMATH DE number 6553002 |
Statements
Approximability of scheduling problems with resource consuming jobs (English)
0 references
9 March 2016
0 references
single machine scheduling
0 references
non-renewable resources
0 references
approximation schemes
0 references
vertex cover problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8788251280784607
0 references
0.8597103357315063
0 references
0.8565190434455872
0 references
0.827221155166626
0 references
