On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705)

From MaRDI portal
Revision as of 17:34, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of uncapacitated multi-plant lot-sizing problems
scientific article

    Statements

    On the computational complexity of uncapacitated multi-plant lot-sizing problems (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    multi-plant lot-sizing
    0 references
    production planning
    0 references
    computational complexity
    0 references
    NP-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references