On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912)
From MaRDI portal
scientific article; zbMATH DE number 7703355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of scheduling unrelated parallel machines with limited preemptions |
scientific article; zbMATH DE number 7703355 |
Statements
On the complexity of scheduling unrelated parallel machines with limited preemptions (English)
0 references
28 June 2023
0 references
scheduling
0 references
unrelated parallel machines
0 references
preemption
0 references
NP-hardness
0 references
0 references
