A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-013-9451-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984292487 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on deterministic online algorithms for scheduling on related machines without preemption |
scientific article |
Statements
A lower bound on deterministic online algorithms for scheduling on related machines without preemption (English)
0 references
12 May 2015
0 references
online algorithms
0 references
scheduling
0 references
makespan
0 references
uniformly related machines
0 references
lower bounds
0 references
