Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (Q2231743)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines |
scientific article |
Statements
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (English)
0 references
30 September 2021
0 references
preemptive scheduling
0 references
release time
0 references
deadlines
0 references
total completion time
0 references
unary NP-hard
0 references
0 references
0 references
0 references
0 references
0 references
0 references
