Journal of the Operational Research Society

, Volume 58, Issue 6, pp 808–815 | Cite as

Effective heuristics for the dynamic demand joint replenishment problem

Theoretical Paper

Abstract

This paper considers the dynamic demand joint replenishment problem where there is a joint setup cost in each time period when any member of the product family is replenished and a separate setup cost for each different item replenished. We present two forward-pass heuristics, a two-phase heuristic, and a simulated annealing metaheuristic (SAM) and investigate their relative effectiveness in solving a comprehensive set of test problems. The experimental results indicate the two-phase heuristic and the SAM perform better than existing approaches for the problem.

Keywords

inventory joint replenishment dynamic demand 

References

  1. Aksoy Y and Erenguc SS (1988). Multi-item inventory models with coordinated replenishments: A survey. Int J Prod Mngt 8: 63–73.CrossRefGoogle Scholar
  2. Atkins D and Iyogun P (1988). A heuristic with lower bound performance guarantee for the multi-product lot-size problem. IIE Trans 20: 369–373.Google Scholar
  3. Blackburn JD and Millen RA (1980). Heuristic lot-sizing performance in a rolling schedule environment. Decis Sci 11: 691–701.CrossRefGoogle Scholar
  4. Boctor FF, Laporte G and Renaud J (2004). Models and algorithms for the dynamic demand joint replenishment problem. Int J Prod Res 42: 2667–2678.CrossRefGoogle Scholar
  5. Dixon PS and Silver EA (1981). A heuristic solution procedure for the multi-item, single-level, limited capacity, lot sizing problem. J Opns Mngt 2: 23–39.Google Scholar
  6. Dogramaci A, Panayiotopoulos JC and Adam NR (1981). The dynamic lot sizing problem for multiple items under limited capacity. AIIE Trans 13: 294–303.CrossRefGoogle Scholar
  7. Eisenhut PS (1975). A dynamic lot sizing algorithm with capacity constraints. AIIE Trans 7: 170–176.CrossRefGoogle Scholar
  8. Erenguc SS (1988). Multi-product dynamic lot-sizing model with coordinated replenishments. Nav Res Logist 35: 1–22.CrossRefGoogle Scholar
  9. Federgruen A and Tzur M (1994). The joint replenishment problem with the time-varying costs and demands: efficient, asymptotic and ɛ-optimal solutions. Opns Res 42: 1067–1086.CrossRefGoogle Scholar
  10. Fogarty D and Barringer R (1987). Joint order release decisions under dependent demand. Prod Invent Mngt J 28(1): 55–61.Google Scholar
  11. Fung RYK and Ma X (2001). A new method for joint replenishment problems. J Opl Res Soc 52: 358–362.CrossRefGoogle Scholar
  12. Hillier FS and Lieberman GJ (2005). Introduction to Operations Research. McGraw-Hill, NY, NY.Google Scholar
  13. Iyogun P (1991). Heuristic methods for the multi-product dynamic lot size problem. J Opl Res Soc 42: 889–894.CrossRefGoogle Scholar
  14. Kao EPC (1979). A multi-product dynamic lot-size model with individual and joint setup costs. Opns Res 27: 279–289.CrossRefGoogle Scholar
  15. Kirca O (1995). A primal-dual algorithm for the dynamic lot-sizing problem with joint setup costs. Nav Res Logist 42: 791–806.CrossRefGoogle Scholar
  16. Joneja D (1990). The joint replenishment problem: new heuristics and worst case performance bounds. Opns Res 38: 711–723.CrossRefGoogle Scholar
  17. Lambrecht MR and Vanderveken H (1979). Heuristic procedures for the single operations, multi-item loading problem. AIIE Trans 11: 319–326.CrossRefGoogle Scholar
  18. Narayanan A and Robinson EP (2006). More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’. Int J Prod Res 44: 383–397.CrossRefGoogle Scholar
  19. Raghavan P (1993). The multi-item lot sizing problem with joint replenishments. PhD Dissertation. Leonard N. Stern School of Business, New York University.Google Scholar
  20. Robinson EP and Gao L (1996). A dual ascent procedure for multi-product dynamic demand coordinated replenishment with backlogging. Mngt Sci 42: 1556–1564.CrossRefGoogle Scholar
  21. Robinson EP and Lawrence FB (2004). Coordinated capacitated lot-sizing problem with dynamic demand: a lagrangian heuristic. Decis Sci 35: 25–54.CrossRefGoogle Scholar
  22. Silver EA (1979). Coordinated replenishments of items under time varying demand: dynamic programming formulation. Nav Res Logist Q 26: 141–151.CrossRefGoogle Scholar
  23. Silver E and Kelle P (1988). More on ‘Joint order release decisions under dependent demand’. Prod Invent Mngt J 29: 71–72.Google Scholar
  24. Silver EA and Meal HC (1973). A heuristic for selecting lot size quantities for the case of a deterministic time varying demand rate and discrete opportunities for replenishment. Prod Invent Mngt J 14: 64–74.Google Scholar
  25. Viswanathan S (1996). A new optimal algorithm for the joint replenishment problem. J Opl Res Soc 47: 936–944.CrossRefGoogle Scholar
  26. Viswanathan S (2002). On optimal algorithms for the joint replenishment problem. J Opl Res Soc 53: 1286–1290.CrossRefGoogle Scholar
  27. Wagner HM and Whitin TM (1958). Dynamic version of economic lot size model. Mngt Sci 5: 89–96.CrossRefGoogle Scholar
  28. Zangwill WI (1966). A deterministic multiproduct, multifacility production and inventory system. Opns Res 14: 486–507.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan Ltd 2006

Authors and Affiliations

  1. 1.Texas A&M UniversityCollege StationUSA
  2. 2.Hofstra UniversityHempsteadUSA

Personalised recommendations