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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 21:33, 5 March 2024

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