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 the normal view instead:
scientific article; zbMATH DE number 6527083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8635347485542297
0 references
0.8262254595756531
0 references
0.8254494667053223
0 references
0.8210679292678833
0 references
0.8093233108520508
0 references
