A lower bound for on-line scheduling on uniformly related machines (Q1970423)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for on-line scheduling on uniformly related machines |
scientific article |
Statements
A lower bound for on-line scheduling on uniformly related machines (English)
0 references
18 April 2001
0 references
preemption
0 references
on-line scheduling of jobs
0 references
uniformly related machines
0 references
0 references
