Optimality of four-threshold policies in inventory systems with customer returns and borrowing/storage options

被引:19
作者
Feinberg, EA [1 ]
Lewis, ME
机构
[1] SUNY Stony Brook, Dept Appl Math & Stat, Stony Brook, NY 11794 USA
[2] Univ Michigan, Dept Ind & Operat Engn, Ann Arbor, MI 48109 USA
关键词
D O I
10.1017/S0269964805050047
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Consider a single-commodity inventory system in which the demand is modeled by a sequence of independent and identically distributed random variables that can take negative values. Such problems have been studied in the literature under the name cash management and relate to the variations of the on-hand cash balances of financial institutions. The possibility of a negative demand also models product returns in inventory systems. This article studies a model in which. in addition to standard ordering and scrapping decisions seen in the cash management models. the decision-maker can borrow and store some inventory for one period of time. For problems with back orders, zero setup costs, and linear ordering, scrapping, borrowing, and storage costs, we show that an optimal policy has a simple four-threshold structure. These thresholds, in a nondecreasing order, are order-up-to, borrow-up-to, store-down-to, and scrap-down-to levels; that is. if the inventory position is too low, an optimal policy is to order up to a certain level and then borrow up to a higher level. Analogously, if the inventory position is too high. the optimal decision is to reduce the inventory to a certain point, after which one should store some of the inventory down to a lower threshold. This structure holds for the finite and infinite horizon discounted expected cost criteria and for the average cost per unit time criterion. We also provide sufficient conditions when the borrowing and storage options should not be used. In order to prove our results for average costs per unit time, we establish sufficient conditions when the optimality equations hold for a Markov decision process with an uncountable state space, noncompact action sets, and unbounded costs.
引用
收藏
页码:45 / 71
页数:27
相关论文
共 43 条
[1]   THE OPTIMALITY OF (S, S) POLICIES FOR A STOCHASTIC INVENTORY PROBLEM WITH PROPORTIONAL AND LUMP-SUM PENALTY COST [J].
ANEJA, Y ;
NOORI, AH .
MANAGEMENT SCIENCE, 1987, 33 (06) :750-755
[2]  
[Anonymous], 1969, INT ECON REV, DOI DOI 10.2307/2525547
[3]  
[Anonymous], SANKHYA INDIAN J S A
[4]  
[Anonymous], 2000, DYNAMIC PROGRAMMING
[5]   OPTIMAL INVENTORY POLICY [J].
Arrow, Kenneth J. ;
Harris, Theodore ;
Marschak, Jacob .
ECONOMETRICA, 1951, 19 (03) :250-272
[6]   Analytic models for when and how to expedite in make-to-order systems [J].
Arslan, H ;
Ayhan, H ;
Olsen, TL .
IIE TRANSACTIONS, 2001, 33 (11) :1019-1029
[7]  
Barankin EW., 1961, NAVAL RES LOGIST Q, V8, P285, DOI DOI 10.1002/NAV.3800080310
[8]  
Bertsekas D. P., 1996, STOCHASTIC OPTIMAL C
[9]  
Bertsekas DP, 1995, Dynamic Programming and Optimal Control, V2
[10]   COMPARING RECENT ASSUMPTIONS FOR THE EXISTENCE OF AVERAGE OPTIMAL STATIONARY POLICIES [J].
CAVAZOSCADENA, R ;
SENNOTT, LI .
OPERATIONS RESEARCH LETTERS, 1992, 11 (01) :33-37