An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959)
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 improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time |
scientific article; zbMATH DE number 7012487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time |
scientific article; zbMATH DE number 7012487 |
Statements
An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (English)
0 references
5 February 2019
0 references
scheduling
0 references
online algorithms
0 references
competitive analysis
0 references
total weighted completion time
0 references
parallel machine
0 references
0 references
0 references
0 references
0 references
0.9424850940704346
0 references
0.8946480751037598
0 references
0.8804928064346313
0 references
