Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (Q4268700)

From MaRDI portal
Revision as of 10:11, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1354360
Language Label Description Also known as
English
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
scientific article; zbMATH DE number 1354360

    Statements

    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (English)
    0 references
    0 references
    28 October 1999
    0 references
    scheduling
    0 references
    approximation algorithm
    0 references
    worst-case analysis
    0 references
    total flow time
    0 references
    release time
    0 references
    single machine
    0 references

    Identifiers

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