Semi-online scheduling problems on a small number of machines (Q398877)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6331181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-online scheduling problems on a small number of machines |
scientific article; zbMATH DE number 6331181 |
Statements
Semi-online scheduling problems on a small number of machines (English)
0 references
18 August 2014
0 references
semi-online scheduling
0 references
competitive ratio
0 references
lower bound example
0 references
0 references
0 references
0.9310347437858582
0 references
0.9189056754112244
0 references
0.90425705909729
0 references
0.9040650725364684
0 references
0.8960866928100586
0 references
