A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:47, 5 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