A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914)
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 better online algorithm for the parallel machine scheduling to minimize the total weighted completion time |
scientific article; zbMATH DE number 6650625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time |
scientific article; zbMATH DE number 6650625 |
Statements
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (English)
0 references
10 November 2016
0 references
online scheduling
0 references
parallel machine
0 references
competitive ratio
0 references
total weighted completion time
0 references
instance reduction
0 references
0 references
0 references
0 references
0 references
0.96517503
0 references
0.9357306
0 references
0.9356996
0 references
0.93349147
0 references
0.92811227
0 references
0.92619175
0 references
0 references
