Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines |
scientific article |
Statements
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (English)
0 references
13 December 2006
0 references
semi-online
0 references
preemptive scheduling
0 references
uniform machines
0 references
competitive ratio
0 references
