Approximation Algorithms for Fixed Job Schedule Problems (Q3990569)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation Algorithms for Fixed Job Schedule Problems
scientific article

    Statements

    Approximation Algorithms for Fixed Job Schedule Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed job schedule problem
    0 references
    polynomial-time approximation algorithms
    0 references
    preemptive relaxation
    0 references
    greedy solution
    0 references