New bounds and heuristics for (Q, r) policies

• 成果类型: Article
• 署名作者: Gallego, G
• 署名单位: Columbia University
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.44.2.219
• 发表日期: 1998
• 页码: 219-233
• 关键词: inventory/production; heuristics; bounds; minmax analysis; sensitivity analysis; stochastic models of inventory with fixed costs

摘要

To clarify the impact of demand variability on single item stochastic inventory systems with setup costs, we subsume the distributional information of the lead time demand into its mean and variance and solve the resulting problem against the worst possible distribution in this class. For (Q, r) policies we obtain in closed form a distribution-free solution for Q and r, and upper bounds on the optimal long run average cost and on the optimal batch size. As a byproduct we develop a robust, distribution-free, batch size heuristic that causes a relative cost increase of no more than 6.07%. In addition, when the newsvendor cost is known, we obtain sharper lower and upper bounds on the long run average cost. These bounds clarify, in an exceedingly simple way, the cost impact of fixed setup costs, demand variability, and constraints on the batch size. We illustrate our bounds and heuristics on problems with Poisson and Compound Poisson demands.