On the complexity of constructing multiprocessor little-preemptive schedules (Q902062): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q940886 |
||
| Property / author | |||
| Property / author: Evgeny V. Shchepin / rank | |||
Revision as of 13:33, 21 February 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
