Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861)

From MaRDI portal
Revision as of 13:13, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57633789, #quickstatements; #temporary_batch_1722424008430)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
scientific article

    Statements

    Minimizing total weighted completion time approximately for the parallel machine problem with a single server (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    parallel machine scheduling
    0 references
    single server
    0 references
    approximation algorithm
    0 references
    worst-case analysis
    0 references

    Identifiers