On the complexity of constructing multiprocessor little-preemptive schedules (Q902062)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of constructing multiprocessor little-preemptive schedules |
scientific article; zbMATH DE number 6527083
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of constructing multiprocessor little-preemptive schedules |
scientific article; zbMATH DE number 6527083 |
Statements
On the complexity of constructing multiprocessor little-preemptive schedules (English)
0 references
7 January 2016
0 references
open shop problem
0 references
