A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490)
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 note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time |
scientific article; zbMATH DE number 6013686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' |
scientific article; zbMATH DE number 6013686 |
Statements
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (English)
0 references
9 March 2012
0 references
online algorithms
0 references
scheduling
0 references
total general completion time
0 references
delayed shortest processing time
0 references
competitive analysis
0 references
0.8507741093635559
0 references
0.839274525642395
0 references
0.7902404069900513
0 references
0.7801378965377808
0 references
0.7747192978858948
0 references
