An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796)
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: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time |
scientific article; zbMATH DE number 5780827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time |
scientific article; zbMATH DE number 5780827 |
Statements
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (English)
0 references
7 September 2010
0 references
analysis of algorithms
0 references
semi-online algorithms
0 references
single machine scheduling
0 references
total weighted completion time
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
0 references
0.9312214851379396
0 references
0.8610859513282776
0 references
0.8581752181053162
0 references
0.8569056987762451
0 references
0.8458055257797241
0 references
