New bounds and heuristics for (Q, r) policies

被引:69
作者
Gallego, G [1 ]
机构
[1] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA
关键词
inventory/production; heuristics; bounds; minmax analysis; sensitivity analysis; stochastic models of inventory with fixed costs;
D O I
10.1287/mnsc.44.2.219
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:219 / 233
页数:15
相关论文
共 17 条
[1]   (S,S) POLICIES UNDER CONTINUOUS REVIEW AND DISCRETE COMPOUND POISSON DEMAND [J].
ARCHIBALD, BC ;
SILVER, EA .
MANAGEMENT SCIENCE, 1978, 24 (09) :899-909
[2]  
AXSATER S, 1993, S95187 LUL U TECHN
[3]  
BROWNE S, 1991, ANN APPL PROBAB, V1, P419
[4]   AN EFFICIENT ALGORITHM FOR COMPUTING AN OPTIMAL (R, Q) POLICY IN CONTINUOUS REVIEW STOCHASTIC INVENTORY SYSTEMS [J].
FEDERGRUEN, A ;
ZHENG, YS .
OPERATIONS RESEARCH, 1992, 40 (04) :808-813
[5]  
GALLEGO G, 1993, J OPER RES SOC, V44, P825, DOI 10.1057/jors.1993.141
[6]  
PORTEUS EL, 1990, HDB OPERATIONS RES M, V2
[7]  
Scarf H., 1958, STUD MATH THEORY INV
[8]  
Serfozo R., 1978, Stochastic Processes & their Applications, V6, P165, DOI 10.1016/0304-4149(78)90058-3
[9]  
Simon RM, 1968, P3938 RAND CORP
[10]  
Stoyan D., 1983, COMP METHODS QUEUES