Two semi-online scheduling problems on two uniform machines (Q1006050)
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 5529504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two semi-online scheduling problems on two uniform machines |
scientific article; zbMATH DE number 5529504 |
Statements
Two semi-online scheduling problems on two uniform machines (English)
0 references
17 March 2009
0 references
analysis of algorithm
0 references
scheduling
0 references
semi-online
0 references
competitive ratio
0 references
0.9220754504203796
0 references
0.9205929040908812
0 references
0.9193871021270752
0 references
0.9164311289787292
0 references
0.9109658002853394
0 references
