A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:25, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for some preemptive multiprocessor task scheduling problems |
scientific article |
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
