Approximate Calculation of Order Fill Rate under Purchase Dependence

다국어 초록 (Multilingual 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.

참고문헌 (Reference)

1 윤승철, "재고보유단위로 관리되는 제품의 재고관리 방법에 관한 연구" 한국산업경영시스템학회 38 (38): 124-130, 2015

2 박경종, "고객 수요가 공급 사슬의 총재고비용과 주문만족율에 미치는 영향" 한국산업경영시스템학회 32 (32): 93-98, 2009

3 Zheng, B., "Two new modified Gauss-Seidel methods for linear system with M-matrices" 233 (233): 922-930, 2009

4 Niethammer, W., "The successive order relaxation method (SOR) and Markov chains" 103 (103): 351-358, 2001

5 Niki, H., "The preconditioned Gauss-Seidel method faster than the SOR method" 219 (219): 59-71, 2008

6 Morimoto, M., "The Gauss-Seidel iterative method with the preconditioning matrix (I+S+Sm)" 21 (21): 25-34, 2004

7 Song, J. S., "Order-fulfillment performance measures in an assemble-to-order system with stochastic lead times" 47 (47): 131-149, 1999

8 Gao, C., "Order-fulfillment performance analysis of an assemble-to-order system with unreliable machines" 126 (126): 341-349, 2010

9 Song, J. S., "On the order fill rate in a multi-item, basestock inventory system" 46 (46): 831-845, 1998

10 Noutsos, D., "On optimal improvements of classical iterative schemes for Z-matrices" 188 (188): 89-106, 2006

11 Iravani, S., "On assemble-to-order systems with flexible customers" 35 (35): 389-403, 2003

12 Philippe, B., "Numerical methods in Markov chain modeling" 40 (40): 1156-1179, 1992

13 Hadjidimos, A., "More on modifications and improvements of classical iterative schemes for M-matrices" 364 : 253-279, 2003

14 Gunawardena, A. D., "Modified iterative methods for consistent linear systems" 154-156 : 123-143, 1991

15 Kohno, T., "Improving the modified Gauss-Seidel method for Z-matrices" 267 : 113-123, 1997

16 Milaszewicz, J. P., "Improving Jacobi and Gauss-Seidel iterations" 93 : 161-170, 1987

17 Ye, J., "Folding algorithm : a computational method for finite QBD processes with level-dependent transitions" 42 (42): 625-639, 1994

18 Park, C., "Consideration of purchase dependence in inventory management" 66 (66): 274-285, 2013

19 Usui, M., "Adaptive Gauss-Seidel method for linear systems" 51 (51): 119-125, 1994

20 Kotakemori, H., "Accelerated iterative method for Z-matrices" 75 (75): 87-97, 1996

21 Kotakemori, H., "A comparison theorem for the iterative method with the preconditioner (I+Smax)" 145 (145): 373-378, 2002