A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888)
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: A polynomial algorithm for some preemptive multiprocessor task scheduling problems |
scientific article; zbMATH DE number 5067646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for some preemptive multiprocessor task scheduling problems |
scientific article; zbMATH DE number 5067646 |
Statements
A polynomial algorithm for some preemptive multiprocessor task scheduling problems (English)
0 references
25 October 2006
0 references
scheduling
0 references
complexity theory
0 references
multiprocessor tasks
0 references
dedicated processors
0 references
0 references
0.8490053415298462
0 references
0.8435390591621399
0 references
0.8402808308601379
0 references
0.8386659622192383
0 references
