Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:20, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential inapproximability and FPTAS for scheduling with availability constraints |
scientific article |
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
