Hardness of Approximating Flow and Job Shop Scheduling Problems (Q5395665)

From MaRDI portal
Revision as of 19:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6258062
Language Label Description Also known as
English
Hardness of Approximating Flow and Job Shop Scheduling Problems
scientific article; zbMATH DE number 6258062

    Statements

    Hardness of Approximating Flow and Job Shop Scheduling Problems (English)
    0 references
    0 references
    0 references
    17 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    job shop scheduling
    0 references
    hardness of approximation
    0 references
    machine scheduling
    0 references
    0 references