On the complexity of constructing multiprocessor little-preemptive schedules (Q902062): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:35, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of constructing multiprocessor little-preemptive schedules |
scientific article |
Statements
On the complexity of constructing multiprocessor little-preemptive schedules (English)
0 references
7 January 2016
0 references
open shop problem
0 references
