A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:10, 3 February 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
16 July 2012
0 references
