On the NP-hardness of scheduling with time restrictions (Q1662160)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-hardness of scheduling with time restrictions |
scientific article |
Statements
On the NP-hardness of scheduling with time restrictions (English)
0 references
17 August 2018
0 references
single-processor scheduling
0 references
time restrictions
0 references
NP-hardness
0 references
0 references
0 references
