Models and algorithms for the dynamic-demand joint replenishment problem

This paper considers the problem of coordinated ordering of items having deterministic but time-varying demands where there is a common ordering cost if one or more of these items are ordered in addition to individual items ordering costs. Two new integer linear-programming formulations are presented and compared with the classical formulation. Several well-known heuristics are described and a new improvement procedure is proposed. The relative performance of these heuristics is assessed. Results show the superiority of the new formulations and of the new improvement procedure.

[1]  Willard I. Zangwill,et al.  A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..

[2]  John J. DeMatteis.  An Economic Lot-Sizing Technique I: The Part-Period Algorithm , 1968, IBM Syst. J..

[3]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[4]  Edward A Silver,et al.  Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation , 1979 .

[5]  Edward P. C. Kao,et al.  A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs , 1979, Oper. Res..

[6]  Fokko ter Haseborg.  On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs , 1982 .

[7]  J. M. Proth,et al.  Le problème multi-produits avec coûts concaves et incitation aux lancements groupés: le cas général , 1985 .

[8]  S. Selcuk Erenguc,et al.  Multiproduct dynamic lot-sizing model with coordinated replenishments , 1988 .

[9]  Paul Iyogun,et al.  A heuristic with lower bound performance guarantee for the multi-product dynamic lot-size problem , 1988 .

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

[11]  Dev Joneja,et al.  The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds , 1990, Oper. Res..

[12]  Paul Iyogun,et al.  Heuristic Methods for the Multi-product Dynamic Lot Size Problem , 1991 .

[13]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[14]  S. Selcuk Erenguc,et al.  A multi-family dynamic lot sizing problem with coordinated replenishments: a heuristic procedure , 1993 .

[15]  Chia-Shin Chung,et al.  Heuristic procedure for a multiproduct dynamic lot‐sizing problem with coordinated replenishments , 1994 .

[16]  Awi Federgruen,et al.  The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions , 1994, Oper. Res..

[17]  Ömer Kirca,et al.  A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs , 1995 .

[18]  Li-Lian Gao,et al.  A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging , 1996 .

[19]  Gerard M. Campbell,et al.  Cyclical schedules for the joint replenishment problem with dynamic demands , 1997 .

[20]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..