Browse > Article
http://dx.doi.org/10.11627/jkise.2017.40.4.137

Approximate Calculation of Order Fill Rate under Purchase Dependence  

Park, Changkyu (College of Business, University of Ulsan)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.40, no.4, 2017 , pp. 137-146 More about this Journal
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
Approximate Calculation; Order Fill Rate; Purchase Dependence; Quasi-Birth-and-Death Process;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 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.
2 Philippe, B., Saad, Y., and Stewart, W.J., Numerical methods in Markov chain modeling, Operations Research, 1992, Vol. 40, No. 6, pp. 1156-1179.   DOI
3 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.   DOI
4 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.   DOI
5 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.   DOI
6 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.   DOI
7 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.   DOI
8 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.   DOI
9 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.   DOI
10 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.   DOI
11 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.   DOI
12 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.   DOI
13 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.   DOI
14 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.   DOI
15 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.   DOI
16 Milaszewicz, J.P., Improving Jacobi and Gauss-Seidel iterations, Linear Algebra and its Applications, 1987, Vol. 93, pp. 161-170.   DOI
17 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.   DOI
18 Niethammer, W., The successive order relaxation method (SOR) and Markov chains, Annals of Operations Research, 2001, Vol. 103, No. 1, pp. 351-358.   DOI
19 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.   DOI
20 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.   DOI
21 Park, C. and Seo, J., Consideration of purchase dependence in inventory management, Computers & Industrial Engineering, 2013, Vol. 66, No. 2, pp. 274-285.   DOI