The complexity of two supply chain scheduling problems (Q2444850)

From MaRDI portal
Revision as of 23:08, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The complexity of two supply chain scheduling problems
scientific article

    Statements

    The complexity of two supply chain scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    computational complexity
    0 references
    manufacturing and scheduling
    0 references
    supply chains
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references