Article ID: | iaor2006107 |
Country: | Netherlands |
Volume: | 163 |
Issue: | 3 |
Start Page Number: | 668 |
End Page Number: | 687 |
Publication Date: | Jun 2005 |
Journal: | European Journal of Operational Research |
Authors: | Stadtler Hartmut, Dudek Gregor |
Keywords: | programming: integer |
It is often proposed that operations planning in supply chains can be organized in terms of a hierarchical planning system. However, the hierarchical approach assumes a single, centralized planning task for synchronizing operations across the supply chain. As central coordination can usually be realized only for isolated parts of an overall supply chain, the question arises whether there are alternative ways of coordination. In this paper we propose a non-hierarchical, negotiation-based scheme which can be used to synchronize plans between two independent supply chain partners linked by material flows. Assuming that plans are generated based upon mathematical programming models, we show how modified versions of these models can be utilized for evaluating material orders or supplies proposed by the supply chain partner and for generating counter-proposals. Resulting is an iterative, negotiation-like process which establishes and subsequently improves a consistent overall plan. Computational tests suggest that the scheme comes close to optimal results as obtained by central coordination.