A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450)

From MaRDI portal
Revision as of 20:40, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
scientific article

    Statements

    A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (English)
    0 references
    8 January 2009
    0 references
    0 references
    scheduling
    0 references
    uniform parallel machines
    0 references
    LPT
    0 references
    approximation algorithms
    0 references