Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for online scheduling with bounded rearrangement at the end |
scientific article |
Statements
Optimal algorithms for online scheduling with bounded rearrangement at the end (English)
0 references
9 January 2012
0 references
online scheduling
0 references
lower bounds
0 references
upper bounds
0 references
online scheduling with bounded rearrangement at the end (BRE)
0 references
