Computational study of the multiechelon production planning problem

Document Type

Article

Publication Title

Naval Research Logistics

Abstract

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.

Publication Date

1-4-1997

Publisher

John Wiley and Sons Inc.

Volume

Vol.44

Issue

Iss.1

Link to Full Text
Request Access

Share

COinS