An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488)

From MaRDI portal
Revision as of 15:02, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    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

    Identifiers