A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines |
scientific article |
Statements
A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (English)
0 references
28 July 2015
0 references
scheduling
0 references
complexity
0 references
identical machines
0 references
preemptive problems
0 references
