论文信息 - A lower bound on a class of coordinated inventory/production problems - 字舞流文

A lower bound on a class of coordinated inventory/production problems

A new lower bound is given for a class of coordinated multi-product inventory problems. The bound has considerable generality and so far shows promise to be good. This promise includes duplicating two recent excellent results from the literature.

Derek Atkins | Paul Iyogun

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

[2] R. Roundy. 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems , 1985 .

[3] Paul H. Zipkin,et al. Approximations of Dynamic, Multilocation Production and Inventory Problems , 1984 .

[4] W. Maxwell,et al. The Joint Replenishment Problem with a Powers-of-Two Restriction , 1985 .

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

[6] E. Ignall. Optimal Continuous Review Policies for Two Product Inventory Systems with Joint Setup Costs , 1969 .

[7] A. Federgruen,et al. Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands , 1984 .

[8] Edward A. Silver,et al. Establishing reorder points in the (S,c,s) coordinated control system under compound Poisson demand , 1981 .

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

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

[11] Dieter Kalin,et al. On the Optimality of (σ, S) Policies , 1980, Math. Oper. Res..