Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337)
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: Exponential inapproximability and FPTAS for scheduling with availability constraints |
scientific article; zbMATH DE number 5577377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential inapproximability and FPTAS for scheduling with availability constraints |
scientific article; zbMATH DE number 5577377 |
Statements
Exponential inapproximability and FPTAS for scheduling with availability constraints (English)
0 references
10 July 2009
0 references
inapproximability
0 references
FPTAS
0 references
machine availability
0 references
total weighted completion time
0 references
scheduling
0 references
0 references
0 references
0.880170464515686
0 references
0.8581565022468567
0 references
0.8525272607803345
0 references
0.8442702889442444
0 references
