Computational study of the multiechelon production planning problem
通过计算实验比较分支切割、拉格朗日松弛和分支定界等方法，为不同结构的多层级生产计划问题推荐最优求解策略。
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc.