Abstract

The principal challenge of inventory control in supply chains is that the interacting autonomous enterprises have to plan their production and logistics under information asymmetry, driven by different, often conflicting objectives. In this paper, four different computational approaches are investigated to cope with this challenge: decomposition, integration, coordination, and bilevel programming. The four approaches are applied to solving the same two-stage economic lot-sizing problem, and compared in computational experiments. The prerequisites of the approaches are analyzed, and it is shown that the profits realized and the costs incurred at the different parties largely depend on the solution approach applied. This research also resulted in a novel coordination mechanism, as well as a new algorithm for the bilevel optimization approach to the investigated lot-sizing problem. A specific goal of this study is to highlight the so far less recognized application potential of the coordination and the bilevel optimization approaches for controlling inventories in a supply chain. © 2012 Elsevier B.V. All rights reserved.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.