Multiproduct dynamic lot-sizing model with coordinated replenishments

In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible.

[1]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[2]  S. Selcuk Erenguc,et al.  Using convex envelopes to solve the interactive fixed-charge linear programming problem , 1988 .

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

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

[5]  L. Zurich,et al.  Operations Research in Production Planning, Scheduling, and Inventory Control , 1974 .

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

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  H. P. Benson,et al.  A finite algorithm for concave minimization over a polyhedron , 1985 .

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

[10]  Antal Majthay,et al.  Quasi-concave minimization subject to linear constraints , 1974, Discret. Math..

[11]  Raymond P. Lutz,et al.  Decision rules for inventory management , 1967 .

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

[13]  J. B. Rosen,et al.  Methods for global concave minimization: A bibliographic survey , 1986 .

[14]  Hamdy A. Taha.  Concave minimization over a convex polyhedron , 1973 .

[15]  Rolf A. Lundin,et al.  Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..

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

[17]  S. S. Erenguc,et al.  The interactive fixed charge linear programming problem , 1986 .

[18]  B. Martos.  The Direct Power of Adjacent Vertex Programming Methods , 1965 .

[19]  C L Doll,et al.  AN ITERATIVE PROCEDURE FOR THE SINGLE-MACHINE, MULTI-PRODUCT LOT SCHEDULING PROBLEM : A WORKING PAPER , 1973 .

[20]  F. J. Gould,et al.  Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model , 1969 .

[21]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[22]  E. Zabel.  Some Generalizations of an Inventory Planning Horizon Theorem , 1964 .

[23]  H. Kunreuther,et al.  Planning Horizons for the Dynamic Lot Size Model with Backlogging , 1974 .