On the exact upper bound for the Multifit processor scheduling algorithm (Q920838): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:20, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exact upper bound for the Multifit processor scheduling algorithm |
scientific article |
Statements
On the exact upper bound for the Multifit processor scheduling algorithm (English)
0 references
1990
0 references
exact upper bound
0 references
independent tasks
0 references
identical processors
0 references
makespan
0 references
Multifit
0 references
