A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2013.09.016 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2013.09.016 / rank | |||
Normal rank | |||
Revision as of 00:05, 9 December 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
0 references
0 references
0 references
0 references
