A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:37, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time |
scientific article |
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
