The joint replenishment problem with quantity discounts under constant demand

Abstract.In many practical situations quantity discounts on basic purchase price exist, and taking advantage of these can result in substantial savings. Quantity discounts have been considered in many production and inventory models. But unlike other research areas, there have been no studies to quantity discounts in the joint replenishment problem. The purpose of this paper is to develop efficient algorithms for solving this problem. Firstly, we suggest useful propositions to develop efficient heuristic algorithms. Secondly, we develop two algorithms using these propositions. Numerical examples are shown to illustrate the procedures of these algorithms. Extensive computational experiments are performed to analyze the effectiveness of the heuristics.

[1]  W. C. Benton,et al.  A classification of literature on determining the lot size under quantity discounts , 1996 .

[2]  M. V. Eijs.  A Note on the Joint Replenishment Problem under Constant Demand , 1993 .

[3]  James L. Zydiak,et al.  Capacitated Multiple Item Ordering with Incremental Quantity Discounts , 1994 .

[4]  E. Arkin,et al.  Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .

[5]  R. Heuts,et al.  Coordinated replenishment systems with discount opportunities , 1994 .

[6]  S. K. Goyal.  Analysis of Joint Replenishment Inventory Systems with Resource Restriction , 1975 .

[7]  S. Goyal.  Determination of Economic Packaging Frequency for Items Jointly Replenished , 1973 .

[8]  E. Silver.  A Simple Method of Determining Order Quantities in Joint Replenishments Under Deterministic Demand , 1976 .

[9]  Meir J. Rosenblatt,et al.  An Improvement of Silver's Algorithm for the Joint Replenishment Problem , 1983 .

[10]  Z. Michalewicz,et al.  A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem , 2000 .

[11]  Amiya K. Chakravarty,et al.  Joint Inventory Replenishments with Group Discounts Based on Invoice Value , 1984 .

[12]  Suresh Kumar Goyal,et al.  The resource constrained multi-item inventory problem with price discount: a geometric programming approach , 1995 .

[13]  S. Goyal.  Determination of Optimum Packaging Frequency of Items Jointly Replenished , 1974 .

[14]  Qing Li.  Solving the multi-buyer joint replenishment problem with the RAND method , 2004, Comput. Ind. Eng..

[15]  R.E. Wildeman,et al.  An efficient optimal solution method for the joint replenishment problem , 1997 .

[16]  H. Pirkul,et al.  Capacitated Multiple Item Ordering Problem with Quantity Discounts , 1985 .

[17]  Faruk Güder,et al.  Fixed cycle ordering policies for capacitated multiple item inventory systems with quantity discounts , 2000 .

[18]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[19]  S. Deshmukh,et al.  Discussion A note on ‘The economic ordering quantity for jointly replenishing items’ , 1993 .

[20]  Suresh Kumar Goyal,et al.  Joint replenishment inventory control: Deterministic and stochastic models , 1989 .

[21]  Faruk Güder,et al.  Non-stationary ordering policies for multi-item inventory systems subject to a single resource constraint and quantity discounts , 1997, Comput. Oper. Res..

[22]  Ömer Kirca,et al.  The coordinated replenishment dynamic lot-sizing problem with quantity discounts , 1996 .

[23]  Meir J. Rosenblatt,et al.  On the economic ordering quantity for jointly replenished items , 1991 .

[24]  Fred W. Glover,et al.  The deterministic multi-item dynamic lot size problem with joint business volume discount , 2000, Ann. Oper. Res..