Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algorithms for online scheduling with bounded rearrangement at the end |
scientific article; zbMATH DE number 5995820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for online scheduling with bounded rearrangement at the end |
scientific article; zbMATH DE number 5995820 |
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
0.9145840406417848
0 references
0.896388053894043
0 references
0.8118206262588501
0 references
0.8040745854377747
0 references
