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

From MaRDI portal
Revision as of 19:08, 9 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)





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
    scheduling
    0 references
    uniform parallel machines
    0 references
    LPT
    0 references
    approximation algorithms
    0 references

    Identifiers