Approximation schemes for parallel machine scheduling with availability constraints (Q642981): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2011.06.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2011.06.007 / rank | |||
Normal rank | |||
Latest revision as of 23:31, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation schemes for parallel machine scheduling with availability constraints |
scientific article |
Statements
Approximation schemes for parallel machine scheduling with availability constraints (English)
0 references
27 October 2011
0 references
PTAS
0 references
inapproximability
0 references
parallel machine
0 references
total weighted completion time
0 references
0 references
0 references
