Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2009.03.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2009.03.012 / rank | |||
Normal rank | |||
Latest revision as of 13:45, 10 December 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
0 references
0 references
