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

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.