Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855)
From MaRDI portal
scientific article; zbMATH DE number 2229455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of preemptive minsum scheduling on unrelated parallel machines |
scientific article; zbMATH DE number 2229455 |
Statements
Complexity of preemptive minsum scheduling on unrelated parallel machines (English)
0 references
16 November 2005
0 references
NP-hard
0 references
Scheduling
0 references
Preemption
0 references
Total completion time
0 references
