TY - JOUR
T1 - Optimal inventory policies for a two-dimensional stochastic inventory model
T2 - A numerical investigation
AU - M'Hallah, Rym
AU - Benkherouf, Lakdere
AU - Al-Kandari, Ahmad
N1 - Publisher Copyright:
© 2020 Elsevier Ltd
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020/7
Y1 - 2020/7
N2 - This paper treats a discrete-time, two-item, stationary, infinite-horizon, stochastic inventory model. The system is reviewed at the beginning of each period where the inventory manager has the option of not ordering or ordering item 1 or item 2 or ordering jointly both items. If an order is made, then a set-up cost that depends on the ordered item(s) is accordingly incurred. The demand of each item in each period follows a known random distribution. In addition, the demands of the items are independent of each other and of the period. Inventory holding or backlogging costs are incurred depending on the stock level. This paper proposes and implements an exact stochastic dynamic program that determines the optimal steady state inventory policy. It exemplifies the form of the optimal policy for a number of demand distributions. This form turns out to be an extended (s, S) policy, where the state R2 of possible inventory levels is naturally partitioned into two non overlapping sets: a stopping set and a continuation set. The stopping set consists of three non-overlapping subsets. The first corresponds to ordering item 1, the second to ordering item 2, and the third to jointly ordering items 1 and 2. In the continuation set, no action is required. The paper further illustrates the behavior of this policy for some interesting limiting cases, and discusses its sensitivity to the problem's parameters.
AB - This paper treats a discrete-time, two-item, stationary, infinite-horizon, stochastic inventory model. The system is reviewed at the beginning of each period where the inventory manager has the option of not ordering or ordering item 1 or item 2 or ordering jointly both items. If an order is made, then a set-up cost that depends on the ordered item(s) is accordingly incurred. The demand of each item in each period follows a known random distribution. In addition, the demands of the items are independent of each other and of the period. Inventory holding or backlogging costs are incurred depending on the stock level. This paper proposes and implements an exact stochastic dynamic program that determines the optimal steady state inventory policy. It exemplifies the form of the optimal policy for a number of demand distributions. This form turns out to be an extended (s, S) policy, where the state R2 of possible inventory levels is naturally partitioned into two non overlapping sets: a stopping set and a continuation set. The stopping set consists of three non-overlapping subsets. The first corresponds to ordering item 1, the second to ordering item 2, and the third to jointly ordering items 1 and 2. In the continuation set, no action is required. The paper further illustrates the behavior of this policy for some interesting limiting cases, and discusses its sensitivity to the problem's parameters.
KW - (s, S) Inventory policy
KW - Dynamic programming
KW - Joint ordering
KW - Optimal solution
KW - Set up cost
KW - Steady state solution
UR - http://www.scopus.com/inward/record.url?scp=85082113174&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2020.104939
DO - 10.1016/j.cor.2020.104939
M3 - Article
AN - SCOPUS:85082113174
SN - 0305-0548
VL - 119
JO - COMPUTERS AND OPERATIONS RESEARCH
JF - COMPUTERS AND OPERATIONS RESEARCH
M1 - 104939
ER -