Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732)

From MaRDI portal
Revision as of 09:49, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5029569
Language Label Description Also known as
English
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
scientific article; zbMATH DE number 5029569

    Statements

    Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (English)
    0 references
    0 references
    0 references
    1 June 2006
    0 references
    approximation algorithm
    0 references
    linear programming relaxation
    0 references
    performance guarantee
    0 references
    precedence constraints
    0 references
    scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references