Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969964129 / rank
 
Normal rank

Latest revision as of 19:55, 19 March 2024

scientific article
Language Label Description Also known as
English
Non-Approximability Results for Scheduling Problems with Minsum Criteria
scientific article

    Statements

    Non-Approximability Results for Scheduling Problems with Minsum Criteria (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    scheduling
    0 references
    unrelated parallel machines
    0 references
    open shop flow shop
    0 references
    APX-hardness
    0 references
    0 references