.png){kind=icon}
返回
Negotiation-based collaborative planning between supply chains partners
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.01.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
supply chain planning
collaborative planning
mixed- integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
PREAI
分享收藏
Compiler optimizations for eliminating barrier synchronization.png)
Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programmingIF0
PREAI
分享收藏
查看更多内容