Privacy preserving coordinated inventory replenishment policies for a vendor and multiple buyers
One of the important streams of research in supply chain management is the coordination between suppliers and retailers by varying the lot-size and the purchase price and common replenishment epoch (CRE). But most of the CRE solutions either assume existence of a central planner who has all the information about the system, or assume that each participant of the computation shares all of his information with other participants. These solutions are problematic when the data is sensitive and the participants are reluctant to share their private information. The development and deployment of privacy preserving coordinating model in supply chain based on common replenishment epoch could allow supply chain collaborations to take place without revealing any participants data to the others, reaping the benefits of collaboration while avoiding the drawbacks. In this paper, secure multi-party computation protocols are applied in the problem of a vendor produces a product in a batch production environment and supplies it to multiple buyers with capacity constraints under deterministic conditions, where the objective is to find a CRE policy for each facility in the system such that the total average ordering and inventory-related cost of the entire system is minimized.
common replenishment epoch privacy preserving supply chain collaboration
Xie Cuihua Zhong Weijun Zhang Yulin
Management Science and Engineering Southeast University Nanjing, jiangsu Province, China
国际会议
2010 Second Asia-Pacific Conference on Information Processing(2010年第二届亚太地区信息处理国际会议 APCIP 2010)
南昌
英文
590-594
2010-09-17（万方平台首次上网日期，不代表论文的发表时间）