A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906)

From MaRDI portal
Revision as of 01:00, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1678859
Language Label Description Also known as
English
A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
scientific article; zbMATH DE number 1678859

    Statements

    A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2001
    0 references
    scheduling with controllable processing times
    0 references
    quadratic programming
    0 references
    approximation algorithm
    0 references
    total weighted completion time problem
    0 references

    Identifiers