Dynamic lot size problems with one-way product substitution

Abstract We consider two multi-product dynamic lot size models with one-way substitution, where the products can be indexed such that a lower-index product may be used to substitute for the demand of a higher-index product. In the first model, the product used to meet the demand of another product must be physically transformed into the latter and incur a conversion cost. In the second model, a product can be directly used to satisfy the demand for another product without requiring any physical conversion. Both problems are generally computationally intractable. We develop dynamic programming algorithms that solve the problems in polynomial time when the number of products is fixed. A heuristic is also developed, and computational experiments are conducted to test the effectiveness of the heuristic and the efficiency of the optimal algorithm.

[1]  Ram Akella,et al.  Single-Period Multiproduct Inventory Models with Substitution , 1999, Oper. Res..

[2]  Yehuda Bassok,et al.  Random Yield and Random Demand in a Production System with Downward Substitution , 1999, Oper. Res..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[5]  Peter Värbrand,et al.  The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs , 1995, J. Glob. Optim..

[6]  Suresh Kumar Goyal,et al.  An EOQ Model with Substitutions between Products , 1996 .

[7]  Hanan Luss,et al.  Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities , 1987, Oper. Res..

[8]  Bruce W. Lamar,et al.  An improved branch and bound algorithm for minimum concave cost network flow problems , 1989, J. Glob. Optim..

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

[10]  Timothy J. Lowe,et al.  Specially Structured Uncapacitated Facility Location Problems , 1995, Oper. Res..

[11]  Jayashankar M. Swaminathan,et al.  Multi-product inventory planning with downward substitution, stochastic demand and setup costs , 2004 .

[12]  V. Hsu.  Dynamic Economic Lot Size Model with Perishable Inventory , 2000 .

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

[14]  David W. Pentico,et al.  The Assortment Problem with Nonlinear Cost Functions , 1976, Oper. Res..

[15]  M. Tzur,et al.  The dynamic transshipment problem , 2001 .

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Panos M. Pardalos,et al.  A polynomial time solvable concave network flow problem , 1993, Networks.

[18]  Julie Ward,et al.  Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks , 1999, Math. Oper. Res..

[19]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[20]  James E. Ward,et al.  A parts selection model with one-way substitution , 1994 .

[21]  Lap Mui Ann Chan,et al.  On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures , 2002, Oper. Res..

[22]  Paul H. Zipkin,et al.  Foundations of Inventory Management , 2000 .

[23]  D. W. Pentico,et al.  The Assortment Problem with Probabilistic Demands , 1974 .

[24]  Narendra Agrawal,et al.  Management of Multi-Item Retail Inventory Systems with Demand Substitution , 2000, Oper. Res..

[25]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[26]  Zvi Drezner,et al.  Deterministic hierarchical substitution inventory models , 2000, J. Oper. Res. Soc..