A tight lower bound for job scheduling with cancellation (Q1044744)
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: A tight lower bound for job scheduling with cancellation |
scientific article; zbMATH DE number 5650161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight lower bound for job scheduling with cancellation |
scientific article; zbMATH DE number 5650161 |
Statements
A tight lower bound for job scheduling with cancellation (English)
0 references
18 December 2009
0 references
on-line algorithms
0 references
scheduling
0 references
lower bounds
0 references
0.7995685935020447
0 references
0.7688425779342651
0 references
0.7647423148155212
0 references
0.7501159906387329
0 references
