Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005313518 / rank | |||
Normal rank | |||
Revision as of 21:25, 19 March 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
