Abstract
This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.
Similar content being viewed by others
References
Amaya CA, Carvajal J, Castaño F (2013) A heuristic framework based on linear programming to solve the constrained joint replenishment problem (C-JRP). Int J Prod Econ 144:243–247
Cha B, Moon I (2005) The joint replenishment problem with quantity discounts under constant demand. OR Spectrum 27:569–581
Duran O, Perez L (2013) Solution of the spare parts joint replenishment problem with quantity discounts using a discrete particle swarm optimization technique. Stud Inf Control 22:319–328
Eynan A, Kropp DH (2007) Effective and simple EOQ-like solutions for stochastic demand periodic review systems. Eur J Oper Res 180:1135–1143
Fogarty DW, Barringer RL (1987) Joint order release decisions under dependent demand. Prod Inventory Manag 28:55–61
Fung R, Ma X (2001) A new method for joint replenishment problems. J Oper Res Soc 52:358–362
Goyal S (1974) Determination of optimum packaging frequency of items jointly replenished. Manag Sci 21:436–443
Goyal S, Belton A (1979) On a simple method of determining order quantities in joint replenishments under deterministic demand. Manag Sci 22:604
Hadley G, Whitin TM (1963) Analysis of inventory systems. Prentice Hall, Upper Saddle River
Jackson P, Maxwell W, Muckstadt J (1985) The joint replenishment problem with a powers-of-two restriction. IIE Trans 17:25–32
Kaspi M, Rosenblatt MJ (1983) An improvement of Silver’s algorithm for the joint replenishment problem. AIIE Trans 15:264–267
Ke GY, Bookbinder JH (2012) Discount pricing for a family of items: the supplier’s optimal decisions. Int J Prod Econ 135:255–264
Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989–2005. Eur J Oper Res 186:1–16
Khouja M, Park S, Saydam C (2005) Joint replenishment problem under continuous unit cost change. Int J Prod Res 43:311–326
Lee F-C, Yao M-J (2003) A global optimum search algorithm for the joint replenishment problem under power-of-two policy. Comput Oper Res 30:1319–1333
Moon I, Goyal S, Cha B (2008) The joint replenishment problem involving multiple suppliers offering quantity discounts. Int J Syst Sci 39:629–637
Moon I, Cha B, Lee C (2011) The joint replenishment and freight consolidation of a warehouse in a supply chain. Int J Prod Econ 133:344–350
Musalem EP, Dekker R (2005) Controlling inventories in a supply chain: a case study. Int J Prod Econ 93:179–188
Paul S, Wahab M, Ongkunaruk P (2014) Joint replenishment with imperfect items and price discount. Comput Ind Eng 74:179–185
Porras E, Dekker R (2006) An efficient optimal solution method for the joint replenishment problem with minimum order quantities. Eur J Oper Res 174:1595–1615
Rao US (2003) Properties of the periodic review (R, T) inventory control policy for stationary, stochastic demand. Manuf Serv Oper Manag 5:37–53
Rosenblatt MJ, Lee HL (1986) Economic production cycles with imperfect production processes. IIE Trans 18:48–55
Salameh MK, Yassine AA, Maddah B, Ghaddar L (2014) Joint replenishment model with substitution. Appl Math Model 38:3662–3671
Silver EA (1976) A simple method of determining order quantities in joint replenishments under deterministic demand. Manag Sci 22:1351–1361
Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling, vol 3. Wiley, New York
Taleizadeh AA, Samimi H, Mohammadi B (2015) Joint replenishment policy with backordering and special sale. Int J Syst Sci 46:1172–1198
Viswanathan S (2002) On optimal algorithms for the joint replenishment problem. J Oper Res Soc 53:1286–1290
Viswanathan S (2007) An algorithm for determining the best lower bound for the stochastic joint replenishment problem. Oper Res 55:992–996
Wang L, Dun C-X, Bi W-J, Zeng Y-R (2012) An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model. Knowl Based Syst 36:104–114
Wu K-S, Ouyang L-Y (2001) (Q, r, L) Inventory model with defective items. Comput Ind Eng 39:173–185
Zhao Y, Katehakis MN (2006) On the structure of optimal ordering policies for stochastic inventory systems with minimum order quantity. Probab Eng Inf Sci 20:257–270
Zhu H, Liu X, Chen YF (2015) Effective inventory control policies with a minimum order quantity and batch ordering. Int J Prod Econ 168:21–30
Acknowledgements
This work was supported by the research fund of Hanyang University (HY-2012-P). The authors wish to thank the editors and the referees for their detailed comments, which have improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Appendix: Convexity of \(\varvec{TC}\left( {\varvec{T},\varvec{ k}} \right)\)
Appendix: Convexity of \(\varvec{TC}\left( {\varvec{T},\varvec{ k}} \right)\)
Hessian matrix of the expected cost function is
The Hessian matrix is not positive definite because the determinants of the first and second principal submatrices are not always positive. Thus, the cost function is not a convex function. Additionally, since the (2, 2) entry of the Hessian matrix is positive in the domain of the variables, the cost function is strictly convex on k for a given T.
Rights and permissions
About this article
Cite this article
Noh, J.S., Kim, J.S. & Sarkar, B. Stochastic joint replenishment problem with quantity discounts and minimum order constraints. Oper Res Int J 19, 151–178 (2019). https://doi.org/10.1007/s12351-016-0281-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-016-0281-6