Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management (Q898713): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2016.12.907 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2524664129 / rank
 
Normal rank

Revision as of 02:31, 20 March 2024

scientific article
Language Label Description Also known as
English
Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management
scientific article

    Statements

    Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management (English)
    0 references
    0 references
    0 references
    18 December 2015
    0 references
    The authors present a model accounting for the supply chain management in companies including different resources and products in different plants, under different markets and along different periods. This model consists of a minimization problem under many constraints which may be linearized. But the authors do not precise the structure of all the many terms which occur in this model. They introduce a Benders decomposition algorithm for the resolution of this model. The paper ends with the presentation and the analysis of experimental results on test problems.
    0 references
    supply chain management
    0 references
    lower bound and upper bounding model
    0 references
    virtual dynamic cellular manufacturing system
    0 references
    Benders decomposition
    0 references

    Identifiers

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