A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243)

From MaRDI portal
Revision as of 20:13, 20 July 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 fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
scientific article

    Statements

    A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (English)
    0 references
    0 references
    20 November 2003
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    precedence relation
    0 references
    approximation algorithm
    0 references