An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488): Difference between revisions
From MaRDI portal
Latest revision as of 00:19, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times |
scientific article |
Statements
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (English)
0 references
28 December 2012
0 references
multipurpose machine scheduling
0 references
online scheduling
0 references
total completion time
0 references
competitive ratio
0 references
0 references
0 references
0 references
