Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Approximate Calculation of Order Fill Rate under Purchase Dependence

구매종속성을 고려한 주문충족률의 근사적 계산

  • Received : 2017.10.10
  • Accepted : 2017.11.09
  • Published : 2017.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

For the competitive business environment under purchase dependence, this paper proposes a new approximate calculation of order fill rate which is a probability of satisfying a customer order immediately using the existing inventory. Purchase dependence is different to demand dependence. Purchase dependence treats the purchase behavior of customers, while demand dependence considers demand correlation between items, between regions, or over time. Purchase dependence can be observed in such areas as marketing, manufacturing systems, and distribution systems. Traditional computational methods have a difficulty of the curse of dimensionality for the large cases, when deriving the stationary joint distribution which is utilized to calculate the order fill rate. In order to escape the curse of dimensionality and protect the solution from diverging for the large cases, we develop a greedy iterative search algorithm based on the Gauss-Seidel method. We show that the greedy iterative search algorithm is a dependable algorithm to derive the stationary joint distribution of on-hand inventories in the retailer system by conducting a comparison analysis of a greedy iterative search algorithm with the simulation. In addition, we present some managerial insights such as : (1) The upper bound of order fill rate can be calculated by the one-item pure system, while the lower bound can be provided by the pure system that consists of all items; (2) As the degree of purchase dependence declines while other conditions remain same, it is observed that the difference between the lower and upper bounds reduces, the order fill rate increases, and the order fill rate gets closer to the upper bound.

Keywords

References

  1. Gao, C., Shen, H., and Cheng, T.C.E., Order-fulfillment performance analysis of an assemble-to-order system with unreliable machines, International Journal of Production Economics, 2010, Vol. 126, No. 2, pp. 341-349. https://doi.org/10.1016/j.ijpe.2010.04.014
  2. Gunawardena, A.D., Jain, S.K., and Snyder, L., Modified iterative methods for consistent linear systems, Linear Algebra and its Applications, 1991, Vol. 154-156, pp. 123-143. https://doi.org/10.1016/0024-3795(91)90376-8
  3. Hadjidimos, A., Noutsos, D., and Tzoumas, M., More on modifications and improvements of classical iterative schemes for M-matrices, Linear Algebra and its Applications, 2003, Vol. 364, pp. 253-279. https://doi.org/10.1016/S0024-3795(02)00570-0
  4. Iravani, S., Luangkesorn, L., and Simchi-Levi, D., On assemble-to-order systems with flexible customers, IIE Transactions, 2003, Vol. 35, No. 5, pp. 389-403. https://doi.org/10.1080/07408170304392
  5. Kohno, T., Kotakemori, H., and Niki, H., Improving the modified Gauss-Seidel method for Z-matrices, Linear Algebra and its Application, 1997, Vol. 267, pp. 113- 123. https://doi.org/10.1016/S0024-3795(97)80045-6
  6. Kotakemori, H., Harada, K., Morimoto, M., and Niki, H., A comparison theorem for the iterative method with the preconditioner (I+Smax), Journal of Computational and Applied Mathematics, 2002, Vol. 145, No. 2, pp. 373-378. https://doi.org/10.1016/S0377-0427(01)00588-X
  7. Kotakemori, H., Niki, H., and Okamoto, N., Accelerated iterative method for Z-matrices, Journal of Computational and Applied Mathematics, 1996, Vol. 75, No. 1, pp. 87-97. https://doi.org/10.1016/S0377-0427(96)00061-1
  8. Milaszewicz, J.P., Improving Jacobi and Gauss-Seidel iterations, Linear Algebra and its Applications, 1987, Vol. 93, pp. 161-170. https://doi.org/10.1016/S0024-3795(87)90321-1
  9. Morimoto, M., Harada, K., Sakakihara, M., and Sawami, H., The Gauss-Seidel iterative method with the preconditioning matrix (I+S+Sm), Japan Journal of Industrial and Applied Mathematics, 2004, Vol. 21, No. 1, pp. 25-34. https://doi.org/10.1007/BF03167430
  10. Niethammer, W., The successive order relaxation method (SOR) and Markov chains, Annals of Operations Research, 2001, Vol. 103, No. 1, pp. 351-358. https://doi.org/10.1023/A:1012936012660
  11. Niki, H., Kohno, T., and Morimoto, M., The preconditioned Gauss-Seidel method faster than the SOR method, Journal of Computational and Applied Mathematics, 2008, Vol. 219, No. 1, pp. 59-71. https://doi.org/10.1016/j.cam.2007.07.002
  12. Noutsos, D. and Tzoumas, M., On optimal improvements of classical iterative schemes for Z-matrices, Journal of Computational and Applied Mathematics, 2006, Vol. 188, No. 1, pp. 89-106. https://doi.org/10.1016/j.cam.2005.03.057
  13. Park, C. and Seo, J., Consideration of purchase dependence in inventory management, Computers & Industrial Engineering, 2013, Vol. 66, No. 2, pp. 274-285. https://doi.org/10.1016/j.cie.2013.06.015
  14. Park, K.J., Effect of customer demand on total inventory cost and order fill rate in a supply chain, Journal of Society of Korea Industrial and Systems Engineering, 2009, Vol. 32, No. 3, pp. 93-98.
  15. Philippe, B., Saad, Y., and Stewart, W.J., Numerical methods in Markov chain modeling, Operations Research, 1992, Vol. 40, No. 6, pp. 1156-1179. https://doi.org/10.1287/opre.40.6.1156
  16. Song, J.S., On the order fill rate in a multi-item, basestock inventory system, Operations Research, 1998, Vol. 46, No. 6, pp. 831-845. https://doi.org/10.1287/opre.46.6.831
  17. Song, J.S., Xu, S., and Liu, B., Order-fulfillment performance measures in an assemble-to-order system with stochastic lead times, Operations Research, 1999, Vol. 47, No. 1, pp. 131-149. https://doi.org/10.1287/opre.47.1.131
  18. Usui, M., Niki, H., and Kohno, T., Adaptive Gauss- Seidel method for linear systems, International Journal of Computer Mathematics, 1994, Vol. 51, No. 1-2, pp. 119-125. https://doi.org/10.1080/00207169408804271
  19. Ye, J. and Li, S., Folding algorithm : a computational method for finite QBD processes with level-dependent transitions, IEEE Transactions on Communications, 1994, Vol. 42, No. 234, pp. 625-639. https://doi.org/10.1109/TCOMM.1994.577090
  20. Yoon, S.C., A study on inventory control method for an item with stock keeping units, Journal of Society of Korea Industrial and Systems Engineering, 2015, Vol. 38, No. 1, pp. 124-130. https://doi.org/10.11627/jkise.2014.38.1.124
  21. Zheng, B. and Miao, S.X., Two new modified Gauss- Seidel methods for linear system with M-matrices, Journal of Computational and Applied Mathematics, 2009, Vol. 233, No. 4, pp. 922-930. https://doi.org/10.1016/j.cam.2009.08.056