A historical note on the complexity of scheduling problems (Q6161270)
From MaRDI portal
scientific article; zbMATH DE number 7702766
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A historical note on the complexity of scheduling problems |
scientific article; zbMATH DE number 7702766 |
Statements
A historical note on the complexity of scheduling problems (English)
0 references
27 June 2023
0 references
partition
0 references
scheduling
0 references
computational complexity
0 references
NP-hardness
0 references
0 references
0 references
