Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:20, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter bound for MULTIFIT scheduling on uniform processors |
scientific article |
Statements
Tighter bound for MULTIFIT scheduling on uniform processors (English)
0 references
25 June 1992
0 references
heuristic algorithms
0 references
uniform-processor
0 references
bin packing
0 references
multiprocessor scheduling
0 references
worst-case analysis
0 references
