Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378)

From MaRDI portal
Revision as of 10:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7239250
Language Label Description Also known as
English
Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
scientific article; zbMATH DE number 7239250

    Statements

    title
    Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (English)
    0 references
    author
    Shi Li
    0 references
    publication date
    25 August 2020
    0 references
    zbMATH Keywords
    scheduling
    0 references
    weighted completion time
    0 references
    time indexed
    0 references
    approximation algorithms
    0 references
    cites work
    Q4818873
    0 references
    Q4535067
    0 references
    Q5501837
    0 references
    Q3579372
    0 references
    Q5501838
    0 references
    Q4526975
    0 references
    Q3840372
    0 references
    Q4252432
    0 references

    Identifiers

    DOI
    10.1137/17M1156332
    0 references
    zbMATH DE Number
    7239250
    0 references
    arXiv ID
    1707.08039
    0 references
    OpenAlex ID
    W3016020363
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5117378&oldid=37266879"
    Powered by MediaWiki