Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q63353562, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q63353562 / rank | |||
Normal rank | |||
Revision as of 23:27, 6 February 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
