An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265)
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 6038105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal online algorithm for single machine scheduling to minimize total general completion time |
scientific article; zbMATH DE number 6038105 |
Statements
An optimal online algorithm for single machine scheduling to minimize total general completion time (English)
0 references
23 May 2012
0 references
online scheduling
0 references
total general completion time
0 references
competitive analysis
0 references
0.8805710077285767
0 references
0.8805710077285767
0 references
0.8774172067642212
0 references
0.8762713074684143
0 references
