Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10114-005-0829-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10114-005-0829-5 / rank | |||
Normal rank | |||
Latest revision as of 05:41, 10 December 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
0 references
0 references
0 references
