Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931)

From MaRDI portal
Revision as of 20:57, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7000357
Language Label Description Also known as
English
Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
scientific article; zbMATH DE number 7000357

    Statements

    Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (English)
    0 references
    0 references
    11 January 2019
    0 references
    0 references
    approximation algorithm
    0 references
    completion time
    0 references
    parallel machine
    0 references
    single machine
    0 references
    flow shop
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references