A note on the Coffman-Sethi bound for LPT scheduling (Q2356126)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A note on the Coffman-Sethi bound for LPT scheduling
scientific article

    Statements

    A note on the Coffman-Sethi bound for LPT scheduling (English)
    0 references
    0 references
    0 references
    28 July 2015
    0 references
    identical parallel machines
    0 references
    makespan minimization
    0 references
    LPT algorithm
    0 references
    Coffman-Sethi
    0 references
    scheduling
    0 references

    Identifiers