An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
scientific article

    Statements

    An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (English)
    0 references
    0 references
    0 references
    5 February 2019
    0 references
    scheduling
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    total weighted completion time
    0 references
    parallel machine
    0 references

    Identifiers