Minimizing total tardiness on parallel machines with preemptions (Q2434279)

From MaRDI portal
Revision as of 02:52, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57633844, #quickstatements; #temporary_batch_1707252663060)
scientific article
Language Label Description Also known as
English
Minimizing total tardiness on parallel machines with preemptions
scientific article

    Statements

    title
    Minimizing total tardiness on parallel machines with preemptions (English)
    0 references
    author
    Svetlana A. Kravchenko
    0 references
    Frank Werner
    0 references
    publication date
    5 February 2014
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    68M20
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6255127
    0 references
    zbMATH Keywords
    parallel machines
    0 references
    total tardiness
    0 references
    preemptive problems
    0 references
    linear programming
    0 references
    polynomial algorithm
    0 references
    NP-hardness
    0 references
    Wikidata QID
    Q57633844
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2434279&oldid=18424796"
    Powered by MediaWiki