Minimizing Makespan in a Class of Reentrant Shops (Q4393117)

From MaRDI portal
Revision as of 20:25, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1161012
Language Label Description Also known as
English
Minimizing Makespan in a Class of Reentrant Shops
scientific article; zbMATH DE number 1161012

    Statements

    Minimizing Makespan in a Class of Reentrant Shops (English)
    0 references
    0 references
    0 references
    0 references
    8 June 1998
    0 references
    chain-reentrant shop
    0 references
    two-machine case
    0 references
    binary NP-hard
    0 references
    approximation
    0 references
    branch-and-bound
    0 references
    worst-case performance
    0 references

    Identifiers