On the complexity of scheduling tasks with discrete starting times (Q1195868)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of scheduling tasks with discrete starting times |
scientific article |
Statements
On the complexity of scheduling tasks with discrete starting times (English)
0 references
4 January 1993
0 references
discrete starting times
0 references
single processor
0 references
NP-complete
0 references
polynomially solvable case
0 references
