Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:08, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal online algorithms on two hierarchical machines with tightly-grouped processing times |
scientific article |
Statements
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (English)
0 references
11 May 2015
0 references
online scheduling
0 references
hierarchy
0 references
competitive ratio
0 references
