Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (Q2286436)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines |
scientific article |
Statements
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (English)
0 references
22 January 2020
0 references
single-machine scheduling
0 references
deadlines
0 references
tardiness
0 references
unary NP-hard
0 references
