Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502)

From MaRDI portal
Revision as of 18:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Non-Approximability Results for Scheduling Problems with Minsum Criteria
scientific article

    Statements

    title
    Non-Approximability Results for Scheduling Problems with Minsum Criteria (English)
    0 references
    author
    Hoogeveen, J. A.
    0 references
    Gerhard J. Woeginger
    0 references
    Petra Schuurman
    0 references
    publication date
    30 May 2012
    0 references
    zbMATH Keywords
    scheduling
    0 references
    unrelated parallel machines
    0 references
    open shop flow shop
    0 references
    APX-hardness
    0 references

    Identifiers

    zbMATH DE Number
    6039055
    0 references
    OpenAlex ID
    W1969964129
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2884502&oldid=31424925"
    Powered by MediaWiki