Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562)
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: Complexity and approximability of scheduling resumable proportionally deteriorating jobs |
scientific article; zbMATH DE number 5685148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of scheduling resumable proportionally deteriorating jobs |
scientific article; zbMATH DE number 5685148 |
Statements
Complexity and approximability of scheduling resumable proportionally deteriorating jobs (English)
0 references
19 March 2010
0 references
scheduling
0 references
deteriorating jobs
0 references
complexity theory
0 references
fully polynomial-time approximation scheme
0 references
0 references
0.9178199172019958
0 references
0.910768449306488
0 references
0.90188068151474
0 references
0.8953085541725159
0 references
0.8723495602607727
0 references
