Privacy Preserving Coordinating Model in Lot to Lot Supply Chain Based on Common Replenishment Epoch

Abstract:

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 lot to lot supply chain based on common replenishment epoch could allow supply chain collaborations to take place without revealing any participant's data to the others, reaping the benefits of collaboration while avoiding the drawbacks. In this paper, we develop and apply secure minimum sum of multi-dimensional protocol to the problem of coordinating a single-vendor multi-retailer inventory system with a probabilistic demand which follows normal distribution, 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.

• Periodical: Applied Mechanics and Materials (Volume 39)
• Pages: 580-587
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.39.580
• Online since: November 2010
• Authors: Wei Jung Zhong, Cui Hua Xie, Yu Lin Zhang
• Keywords: Common Replenishment Epoch, Privacy Preserving, Supply Chain Collaboration

References

[1] S Viswanathan , Piplani R. Coordinating supply chain inventory through common replenishment epochs [ J ] . European Journal of Operational Research, 129 (2) : 277 - 286, (2001).

DOI: 10.1016/s0377-2217(00)00225-3

[2] Ajay K. Mishra. Selective discount for supplier-retailer coordination using common replenish- ment epochs [J]. European Journal Of Operational Research, 153(3): 7512-7561, (2004).

DOI: 10.1016/s0377-2217(02)00811-1

[3] LiuYong-sheng. On Inventory Coordination Policy in Supply Chain [J]. Chinese Journal of Management Science, 12(2): 49-54, 2004. (In Chinese).

[4] LiuYong-sheng. On Supply Chain Coordination Policy under Elastic Demand [J]. Industrial engineering journal, 6(4) ：31-35, 2003. (In Chinese).

[5] Cao Zong-hong. Coordination and Optimization Model under Stochastic Demand in Supply Chain [J], college mathematics, 23 (2): 74～79, 2007. (In Chinese).

[6] JI Shou-fen. Coordinating model and simulation in lot to lot supply chain based on common replenishment epoc [J]. Computer Integrated Manufacturing Systems, 14(3): 482-486, (2008).

[7] Goyal, S.K., Gupta, Y.P. Integrated inventory models: The retailer–vendor coordination. European Journal of Operational Research 41, 261–269, (1989).

DOI: 10.1016/0377-2217(89)90247-6

[8] Munson, C.L., Rosenblatt, M.J. Theories and realities of quantity discounts: An exploratory study. Production and Operations Management 7 (4), 352–369, (1998).

DOI: 10.1111/j.1937-5956.1998.tb00129.x

[9] Lee, H., S. Whang. Information sharing in a supply chain. Int. J. Tech. Management 20(3), p.373– 387, (2000).

[10] Porter, M.E. (1985) Competitive Advantage, Free Press, New York, (1985).

[11] Yao A. Protocols for secure computations [C]/The 23rd Annual Symp on the Foundations of Computer Science. Chicago: 160-164, (1982).

[12] Goldreich O. Secure multi-party computation [EB/OL]. (2006-08-06). http: /www. Wis dom. Weizmann. ac. il/~oded/pp. html.

[13] Atallah M J. Elmongui H G, Deshpande V, et al. Secure supply chain protocols [C]. IEEE International Conference on Electronic Commerce. California, USA: 293-302, (2003).

DOI: 10.1109/coec.2003.1210264

[14] Chu C-L, Leon V J. Single-vendor multi-retailer inventory coordination under private information [J]. European Journal of Operational Research, 191(2): 485-503, (2008).

DOI: 10.1016/j.ejor.2007.06.046

[15] Chu C L, Leon V J. Power-of-two single-warehouse multi-retailer inventory coordination with private information[J]. International Journal of Production Economics, 111(2): 562-574, (2008).

DOI: 10.1016/j.ijpe.2006.12.063

[16] Chu C-L, Leon V J. Scalable methodology for supply chain inventory coordination with private information[J]. European Journal of Operational Research, 195(1): 262-279, (2009).

DOI: 10.1016/j.ejor.2008.01.046

[17] Li Shundong, Dai Yiqi, You Qiyou. An efficient solution to Yao's millionaires' problem [J]. Acta Electronica Sinica, 33(5): 769-773, 2005. (In Chinese).

[18] Atallah M J, Du W L. Secure multiparty computational geometry [C]. WADS2001: Seventh International Workshop on Algorithm and data Structures. Providence, Rhode Island, USA, 2001: 165-179.

[19] Du W L. A study of several specific secure two party computation problems [D]. USA: Purdue University, (2001).

[20] Luo Wen Jun, Li Xiang. A study of secure multi-party statistical analysis [C]/Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing. Shanghai, China: 377-383, (2003).

DOI: 10.1109/iccnmc.2003.1243074