Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10114-005-0829-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969445568 / rank | |||
Normal rank | |||
Revision as of 21:12, 19 March 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
