1. INTRODUCTION
After-sale parts and services are becoming an important aspect of closed-loop supply chains (see Guide and Wassenhove [7]). In cases where the original equipment manufacturer (OEM) manages the inventory for the product under warranty, the manufacturer needs to synergize inventory planning activities across new demand and demand arising from products under warranty.
In this article we consider a discrete-time multiperiod inventory model that jointly manages the inventory requirements for new products and warranty claims. Throughout this article we will restrict our attention to a single product. We assume that the demand in each period for the new product is stochastic and independent (not necessarily identical), whereas warranty claims are proportional to the number of products currently under warranty. Further, a fixed fraction of products under warranty in the field go out of warranty every period. The ordering, holding, and penalty costs are assumed to be linear and there is no delivery lag. We study the standard backlogging case and also the emergency supply case (with no backlogging) where the demand that cannot be satisfied by items in stock has to be satisfied by ordering from an emergency supplier. We prove that there exist functions Sn(w) so that it is optimal to order up to Sn(w) in period n if there are w items under warranty at that time. We call this a w-dependent base stock policy. The critical value Sn(w) can be explicitly obtained by solving for the root of a single transcendental equation. For the special case where the demand for new products is stationary, we prove the optimality of a stationary w-dependent base stock policy for the finite-horizon discounted-cost and the infinite-horizon discounted- and average-cost cases. In our computational study, we compare the performance of such an integrated policy to a policy that only takes new demand into consideration while planning inventory. Our study indicates that, on average, 53% cost improvements can be obtained from using the optimal integrated policy.
The rest of the article is organized as follows. We include a brief literature review of related research in Section 2. We formulate the problem in backlogging case in Section 3. We study the structure of the optimal inventory policy for the finite-horizon problem in Section 4, infinite-horizon discounted problem in Section 5, and long-run average-cost problem in Section 6. In Section 7 we study the extensions of the failure models and warranty expiration models. In Section 8 we formulate the problem in the emergency supply case and study the optimal inventory policy for the finite-horizon problem. In Section 9 we provide computational insights. We provide extensions and conclusions in Section 10.
2. LITERATURE REVIEW
There are three streams of research that are related to our inventory–warranty model. The first stream of research focuses on the effects of warranty under deterministic demand conditions. Porteus [12] considered a lot-sizing problem where the process goes out of control with a given probability each time it produces an item. He showed that the optimal lot size is smaller than the classical economic manufacturing quantity. Djamaludin, Murthy, and Wilson [5] and Wang and Sheu [15] studied other extensions of this scenario to find the optimal lot size taking into account long-run production inventory and warranty costs. As opposed to this stream, our focus is on periodic review warranty systems with stochastic demands.
The second stream of literature has studied production systems with inventory-dependent deterministic demand without warranty considerations. Khmelnitsky and Gerchak [10] studied a continuous review deterministic inventory model where demand rates can vary over time, shortages are possible, and the system has finite production capacity and find the optimal production control polices for such a system. Baker and Urban [1] analyzed the continuous, deterministic case of an inventory system in which the demand rate of an item is of a polynomial functional form, dependent on the inventory level. They developed the optimal policy to maximize average profit per unit time. In our work, the future requirement of a product is not only dependent on current inventory but also on previous sales.
The third stream of research considers inventory planning in a periodic setting under stochastic demand (see Swaminathan and Tayur [14] for a recent review). Within that stream of articles, those that consider return or remanufacturing are related to our work. Cohen, Nahmias, and Pierskalla [3] assumed that a fixed fraction of the products issued in a given period is returned after a fixed sojourn time in the market and might subsequently be reused. Optimality of a periodic review order-up-to policy is claimed assuming zero fixed cost and zero procurement lead times. Kelle and Silver [9] extended this approach by allowing for fixed order costs and stochastic sojourn time in the market. They proposed an approximation scheme transforming this model into a classical dynamic lot-sizing problem. Yuan and Cheung [16] proposed for this model an (s,S)-reorder policy based on the sum of the on-hand stock and the number of items in the market. The single-stage remanufacturing system was first studied by Simpson [13] and Inderfurth [8]. Simpson [13] established the optimality of a three-parameter policy consisting of remanufacture-up-to, order-up-to, and dispose-down-to levels. Inderfurth [8] extended those results to the case of positive but identical lead times for ordering and remanufacturing and argued that if lead times are not identical, then the optimal policy will be more complicated. More recently, Feinberg and Lewis [6] considered a single commodity inventory system in which the demand is modeled by a sequence of independent and identically distributed (i.i.d.) random variables that can take negative values (thereby modeling some of the remanufacturing or product return settings). A multiechelon remanufacturing system has been studied by DeCroix [4]. As opposed to this stream of research where remanufacturing or returns increase supply, in our model the demand increases when there are warranty claims. This creates additional dependence between sales in the past and demand in the future, making the analysis complicated.
3. MODEL WITH BACKLOGGING
In our model, inventory for a single product is managed for multiple periods. The firm offers replacement of items that fail under warranty. The demand arises from two sources: new demand and demand to replace failed items under warranty. Let ζn be the new demand in period n. Let Fn(·) be its cumulative distribution function (c.d.f.), and fn(·) be its probability density function (p.d.f.). Let Xn be the inventory on hand and let Wn be the number of items under warranty in period n. In period n, we decide to order an amount An and define Yn = Xn + An. We treat Yn ≥ Xn as the decision variable in period n. The delivery is assumed to be instantaneous, so that Yn is the amount available to satisfy the demand for new and warranty claims in period n. Any demand that cannot be immediately satisfied is backlogged.
We assume that the warranty is renewable (i.e., the warranty period of the replaced item starts afresh). Such warranty models have been studied in the past (see Blischke and Murthy [2]). Also, we assume that the demand to replace failed items is based on a fixed proportional model (i.e., a fixed fraction β of the items under warranty fail in any given period). Furthermore, in period n, a fixed fraction δ of the items under warranty remains in warranty and the remaining fraction (1 − δ) of the items goes out of warranty. These are only approximations to the true system in which the number of failures and the number of items remaining under warranty depend exclusively on the warranty time and age distribution of items in the field. These assumptions keep the analysis tractable. We will treat the model with random β and δ in Section 7. Under these assumptions, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm001.gif?pub-status=live)
where [Xn]− = −min(Xn,0). Thus, {((Wn,Xn),Yn),n ≥ 0} is a Markov decision process. The term [Xn]− in (1) accounts for the fact that when backorders are filled, they get added to the items under warranty.
Next we describe the cost structure. We assume that there is a per-unit procurement cost c, holding cost h for each item remaining at the end of a period, and shortage cost p for each unit of backlogged demand in any period. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm002.gif?pub-status=live)
represent the expected penalty and holding cost incurred in period n if Wn = w and Yn = y. The total one-period expected cost incurred for ordering up to y ≥ x is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm003.gif?pub-status=live)
Let α, 0 ≤ α ≤ 1, be the discount factor. Let π be any policy for choosing decision Yn at time n, based on the history up to time n. We consider three objective functions for choosing an optimal policy as described below.
3.1. Finite Horizon
Under this objective function we try to minimize the expected total discounted cost (ETDC) over periods 0,1,2,…, N. Let VNπ(w,x) be the ETDC of following the policy π over periods 0,1,…, N. Since we have a finite horizon, we need to specify the terminal cost. Let T(w,x) be the terminal cost at time N if WN = w and XN = x. Thus,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm004.gif?pub-status=live)
Here Eπ denotes the expectation under the assumption that the policy π is followed. Let VN(w,x) be the optimal ETDC of operating the system over period 0,…, N; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm005.gif?pub-status=live)
A policy π* is called optimal for finite-horizon ETDC if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm006.gif?pub-status=live)
3.2. Infinite-Horizon ETDC
The second objective function is to minimize the ETDC over the infinite horizon. In this case, there is no terminal cost function. Let Vπ(w,x) be the infinite-horizon ETDC of following policy π; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm007.gif?pub-status=live)
Similarly, let V(w,x) be the optimal infinite-horizon ETDC; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm008.gif?pub-status=live)
A policy π* is called optimal for infinite-horizon ETDC if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm009.gif?pub-status=live)
3.3. Infinite-Horizon Average Cost
Let gπ(w,x) be the expected cost per period of following policy π over the infinite horizon starting from state (w,x). Again, there is no terminal cost in this formulation. Thus, assuming that the limit exists,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm010.gif?pub-status=live)
Typically, this limit is independent of the starting state (w,x). Let g(w,x) be the optimal expected cost per period over the infinite horizon starting in state (w,x); that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm011.gif?pub-status=live)
Typically this infimum does not depend on the initial state (w,x). A policy π* is called optimal for infinite-horizon average cost if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm012.gif?pub-status=live)
We obtain optimal policies under all three objective functions, beginning with the finite-horizon ETDC in the next section.
4. FINITE HORIZON
In this section we study the finite-horizon problem with N periods and terminal cost T(w,x) and show how to compute VN(w,x) of (5). First, define Vn,N(w,x) to be the optimal ETDC over periods n,n + 1,…, N starting with Wn = w and Xn = x. Let Gn,N(w,x,y) be the ETDC over periods n,n + 1,…, N given Wn = w,Xn = x, and Yn = y. Then the standard dynamic programming (DP) recursion yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm001.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-74683-mediumThumb-S0269964807070167frm013.jpg?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm002.gif?pub-status=live)
where Ln(w,y) is as in (2). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm014.gif?pub-status=live)
We will show that with a judicious choice of the terminal cost function T, the value of y that minimizes the function Gn,N(w,y,x) is in fact independent of x. One such special terminal cost function is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm015.gif?pub-status=live)
The above terminal cost is easily explained if we assume that any leftover inventory at period N can be returned at the original purchase price c and any backlog has to be satisfied at purchase cost c. Furthermore, all of the warranty claims arising out of the w items under warranty and the [x]− items sold at time N have to be covered. With this terminal operation, the first term in (15) reflects the cost of processing the terminal inventory x. The second term represents the expected discounted cost of warranty claims of [x]− items sold at period N, since these products will be introduced into the field only in the next period. The third term represents the similar warranty cost for the w items under warranty at period N.
Now let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm016.gif?pub-status=live)
For n = 0,1,…, N − 1, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm017.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm003.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm004.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm018.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm005.gif?pub-status=live)
Here Ln is the same as the function Ln of (2), with p replacing p. Note that Δn is in fact independent of w. This observation is crucial in deriving our results. Also, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm019.gif?pub-status=live)
Theorem 1: Suppose the demands in each period are stochastically increasing; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm020.gif?pub-status=live)
Then
(i)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-44116-mediumThumb-S0269964807070167frm021.jpg?pub-status=live)
for n = 0,…, N − 1. Furthermore, y = Sn(w) minimizes Gn(w,x,y) for n = 0,…, N − 1 and Gn,N(w,x,y) increases with respect to y when y ≥ Sn(w).
(ii)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm006.gif?pub-status=live)
is an increasing function of y when y ≥ Sn−1(w) for a given w for n = 1,…, N − 1.
(iii)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm022.gif?pub-status=live)
The proof follows from a series of claims using backward induction.
Claim 1: Parts (i), (ii), and (iii) hold for N − 1.
Proof:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-41365-mediumThumb-S0269964807070167ffm007.jpg?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-83158-mediumThumb-S0269964807070167ffm008.jpg?pub-status=live)
It is easy to see that y = SN−1(w) = βw + FN−1−1((p − c(1 − α))/(p + h)) minimizes GN−1,N(w,x,y) for all x. Hence, GN−1,N(w,x,y) increases with respect to y when y ≥ SN−1(w). Therefore, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm023.gif?pub-status=live)
Using the notation ΔN−1 from (18), it is easy to show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm024.gif?pub-status=live)
Hence, we can rewrite (23) as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm009.gif?pub-status=live)
where HN−1(w,x) is as given as (19).
Next we show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm010.gif?pub-status=live)
is an increasing function of y, for y ≥ SN−2(w). Taking the first-order derivative with respect to y, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-13260-mediumThumb-S0269964807070167frm025.jpg?pub-status=live)
where G3 represents the first partial with respect to the third argument of G. Since SN−1(w) minimizes GN−1,N(w,x,y) and the definition of HN−1(w,x), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm026.gif?pub-status=live)
From the assumption in (20) we get SN−2(w) ≤ SN−1(w) + βδw. This proves that the quantity in (25) is nonnegative when y ≥ SN−2(w). █
Claim 2: If parts (i), (ii), and (iii) of Theorem 1 hold for n ≤ N − 1, then they hold for n − 1.
Proof: The induction hypothesis implies that we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-81516-mediumThumb-S0269964807070167ffm011.jpg?pub-status=live)
y = Sn(w) minimizes Gn,N(w,x,y), and Gn,N(w,x,y) increases with respect to y when y ≥ Sn(w). Also,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm012.gif?pub-status=live)
is an increasing function of y when y ≥ Sn−1(w). We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-28595-mediumThumb-S0269964807070167ffm013.jpg?pub-status=live)
and, correspondingly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm014.gif?pub-status=live)
Therefore, from the DP recursion in (13) we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-89268-mediumThumb-S0269964807070167ffm015.jpg?pub-status=live)
which implies that (i) holds for n − 1. It is easy to see that y = Sn−1(w) minimizes c(1 − α)y + αLn−1(w,y). Assumption (20) implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm027.gif?pub-status=live)
which shows that τn(w,Sn−1(w)) < 0. This proves that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm028.gif?pub-status=live)
Then y = Sn−1(w) minimizes Gn−1,N(w,x,y). Hence, Gn−1,N(w,x,y) increases with respect to y when y ≥ Sn−1(w). Furthermore, the first-order derivative of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm016.gif?pub-status=live)
with respect to y is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-13871-mediumThumb-S0269964807070167ffm017.jpg?pub-status=live)
Here the superscript 3 denotes the partial derivative of the function g with respect to its third argument. Now the right-hand side is nonnegative when y ≥ Sn−2(w), since Gn−1,N(w,x,y) increases with respect to y when y ≥ Sn−1(w), and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm029.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm030.gif?pub-status=live)
Thus, (ii) holds for n − 1.
This implies that the base stock level policy, which orders up to Sn−1(w), is the optimal for the discounted-cost function over n − 1,n,…, N periods. Clearly, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm031.gif?pub-status=live)
Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm018.gif?pub-status=live)
which implies that (iii) holds for n − 1. Theorem 1 follows from this. █
This yields the main result as stated in the following theorem. It is an immediate result of Theorem 1.
Theorem 2: Let Sn(w) be as given in (17). It is optimal to order up to Sn(w) in period n if Wn = w and Xn = x.
We call the policy in Theorem 2 a w-dependent base stock policy.
Special Case (i.i.d. Demands): Consider the special case where Fn(x) = F(x) for n = 0,1,…, N − 1; that is, the demands are i.i.d. In this case, the base stock level in period n is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm032.gif?pub-status=live)
for all n = 0,…, N − 1. Thus, the stationary w-dependent base stock policy is optimal in this case. It is unusual to get a stationary optimal policy for a finite-horizon problem. However, the special structure of our terminal cost facilitates this result.
5. INFINITE-HORIZON DISCOUNTED COST
In this section we study the infinite-horizon discounted-cost problem with i.i.d. demands. In Section 4 we have proved that in the i.i.d. demands case, the stationary w-dependent base stock policy minimizes the total expected discounted (or undiscounted) cost over any finite horizon N. We denote this stationary policy by π*. Thus, we have shown that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm019.gif?pub-status=live)
In this section we will show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm020.gif?pub-status=live)
that is, π* also minimizes the expected total discounted cost over the infinite horizon. Our main result is given in the next theorem.
Theorem 3: Suppose Fn(x) = F(x) for all n ≥ 0. Then the stationary w-dependent base stock policy that orders up to S(w) = βw + F−1((p − c(1 − α))/(p + h)) in any period in state (w,x) minimizes the infinite-horizon discounted cost.
Proof: From (1), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm033.gif?pub-status=live)
Hence, taking expected values,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm034.gif?pub-status=live)
where μ = E(ζn). Iterating the above we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm021.gif?pub-status=live)
The effect of the initial inventory X0 = x is to increase the above right-hand side at most by δNx. Also, Eπ*(XN) ≥ −μ. Combining the above arguments we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm022.gif?pub-status=live)
Hence,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm035.gif?pub-status=live)
Hence, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm036.gif?pub-status=live)
that is, π* is optimal for the infinite-horizon discounted-cost case. █
6. INFINITE-HORIZON AVERAGE COST
In this section we study the infinite-horizon average-cost problem with i.i.d. demands. We first consider a finite-horizon model with no discounting (α = 1) with a special terminal cost given by (15) at time N, and we assume independent and identical demands with distributions Fn(x) = F(x).
Theorem 4: Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm037.gif?pub-status=live)
The stationary base stock policy that orders up to S(w) in state (w,x) minimizes the N-period total cost.
Denote this stationary base stock policy as π*. Let the expected cost per period of following policy π for a finite-horizon N starting from state (w,x) be defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm038.gif?pub-status=live)
and let gN(w,x) be the optimal expected cost per period for a finite-horizon N starting in state (w,x); that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm039.gif?pub-status=live)
Theorem 4 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm040.gif?pub-status=live)
Hence, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm041.gif?pub-status=live)
We will show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm042.gif?pub-status=live)
and that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm043.gif?pub-status=live)
exists. This will establish that π* minimizes the expected cost per period over the infinite horizon. To prove that the limit in (43) exists, we prove the following properties of (Wn,Xn).
Theorem 5: Under the policy π*, {(Wn,Xn),n ≥ 0} is an irreducible, aperiodic, and positive recurrent Discrete Time Markov Chain (DTMC).
Proof: From the definition of the base stock policy and (1),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm023.gif?pub-status=live)
where S(Wn) is as in (37). This implies that {(Wn,Xn),n ≥ 0} is a DTMC. It is easy to show that it is irreducible and aperiodic. We prove the positive recurrence by using the Foster's criterion (Meyn and Tweedie [11]). We choose the following test function υ(W,X) = |X| + W. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm024.gif?pub-status=live)
When x ≥ 0, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-04796-mediumThumb-S0269964807070167ffm025.jpg?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-92272-mediumThumb-S0269964807070167ffm026.jpg?pub-status=live)
Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-47365-mediumThumb-S0269964807070167ffm027.jpg?pub-status=live)
The last expression is <0 if (1 − δ)(w + x) > F−1(p/(p + h)) + (1 + δ)μ. When x ≤ 0, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm028.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-29287-mediumThumb-S0269964807070167ffm029.jpg?pub-status=live)
Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm030.gif?pub-status=live)
The last expression is <0 if (1 − δ)(w − x) > F−1(p/(p + h)) + (1 + δ)μ.
Now define A = {(w,x) : (1 − δ)(w + |x|) ≤ F−1(p/(p + h)) + (1 + δ)μ}. Note that A is a finite set. Based on the above properties, we have shown that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm044.gif?pub-status=live)
Then Foster's criterion implies that {(Wn,Xn),n ≥ 0} is an irreducible and positive recurrent DTMC. █
Next, we show the existence of the limit of N period average total cost when N goes to infinity.
Theorem 6:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm031.gif?pub-status=live)
exists and is finite for all (w,x).
Proof: We obtain the total cost at period n as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-59032-mediumThumb-S0269964807070167ffm032.jpg?pub-status=live)
When x ≥ 0, we could rewrite the above quantity as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-73041-mediumThumb-S0269964807070167ffm033.jpg?pub-status=live)
When x ≤ 0, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm034.gif?pub-status=live)
Hence, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm035.gif?pub-status=live)
The above bound along with the fact that {(Wn,Xn),n ≥ 0} is a positive recurrent and irreducible implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm045.gif?pub-status=live)
exists and is finite. █
Finally, we study the property of the special terminal cost and derive the optimal inventory policy to minimize the long-run average cost.
Theorem 7: The stationary w-dependent base stock level policy π* minimizes the expected cost per period over the infinite horizon.
Proof: Using the terminal cost in (15) and using the argument in Theorem 3, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm036.gif?pub-status=live)
Hence,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm046.gif?pub-status=live)
Since the w-dependent base stock policy minimizes the expected cost per period over N periods for each N, it is clear that it minimizes the long-run average cost. █
Note that the stationary w-dependent policy of Theorem 7 is independent of the parameters c and δ. This is so because all demands and their warranty-related subsequent demands will eventually be satisfied and there is no discounting.
7. EXTENSIONS OF THE PROPORTIONAL MODEL
In Section 6 we derived optimal inventory replenishment policies assuming the following:
- Proportional Warranty Expiration Model: a fixed fraction 1 − δ of the items under warranty a period n go out of warranty by time n + 1,
- Proportional Failure Model: a fixed fraction β of the items under warranty fail during that period.
In this section we relax some of these assumptions.
7.1. Extensions of the Warranty Expiration Model
Here we assume that a random fraction δn of items under warranty at time n continue to be under warranty at time n + 1 and that {δn,n ≥ 0} is a sequence of i.i.d. random variables over (0,1) with common c.d.f. G(·) and mean δ. We keep the assumption of constant β for all periods n. Then the number of items under warranty change according to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm047.gif?pub-status=live)
With this modification, most of the analysis of the previous sections remains valid. We mention only those parts that change. Equation (13) for Gn,N(w,x,y) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-79959-mediumThumb-S0269964807070167ffm037.jpg?pub-status=live)
Theorem 1 remains valid with the corresponding modifications. Hence, we see that the w-dependent base stock policy that orders up to Sn(w), as defined in (17), in period n in state (w,x) remains optimal. We need to just interpret δ of (17) as the expected value of δn.
Note that the intuitive model in which each model goes out of warranty with a given probability in each period is not a special case of random δ model. Thus, the above policy will not be valid in this case. We will study more realistic warranty expiration models in a separate article in the near future.
7.2. Extensions of the Failure Model
Next, assume that δn are i.i.d. random variables with support on [0, 1] and common mean δ. Furthermore, assume that a random fraction βn of items under warranty at time n fail during that period. Assume that {βn,n ≥ 0} are i.i.d. random variables with support on [0, 1] and common mean β. Unfortunately, the results about optimal policies derived earlier fail to hold in this case. Thus, there might not be a w-dependent optimal policy in this case. Hence, we develop a heuristic to handle this case.
Now suppose Wn = w. Then the total demand in period n is given by Dn = ζn + βn w. Let Fn,w be the distribution of Dn and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm038.gif?pub-status=live)
where p is as defined in (16). Now consider a policy that orders up to Sn(w) when the state is (w,x) in period n. Clearly, this policy reduces to the provable optimal policy when βn = β, a fixed constant for all n. One can also show that this policy is optimal for a one-period problem (N = 1). Hence, we propose this policy as a heuristic policy to be used when our constant β model fails to hold.
One advantage of this model is that it is fairly straightforward to estimate δ and β from observable data.
8. MODEL WITH EMERGENCY SUPPLY
In this section we study the emergency supply model where the demands cannot be backlogged. Instead, the manufacturer has to satisfy the unmet demands by purchasing the items from an emergency supplier. We use p as the per-unit emergency purchase cost where p > c. Note that there are no shortages in this model. As earlier, let β be the constant failure failure fraction and 1 − δ be the constant warranty expiration rate in period n. The dynamic of the system is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm039.gif?pub-status=live)
In this section we study the finite-horizon ETDC problem with N periods and terminal cost T(w,x) and show how to compute VN(w,x) of (5). First, define Vn,N(w,x) to be the optimal ETDC over periods n,n + 1,…, N starting with Wn = w and Xn = x. Let Gn,N(w,y) − cx be the ETDC over periods n,n + 1,…, N given Wn = w and Yn = y. Then the standard dynamic programming recursion yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm040.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm048.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm041.gif?pub-status=live)
where Ln(w,y) is as in (2). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm049.gif?pub-status=live)
We will use the following special terminal cost function:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm050.gif?pub-status=live)
The above terminal cost is easily explained if we assume that any leftover inventory at period N can be returned at the original purchase price c. Furthermore, all of the warranty claims arising out of the w items under warranty have to be covered. With this terminal operation, the first term in (50) reflects the cost of processing the terminal inventory x and the second term is the cost of the warranty claims arising from the w items left under warranty at the end of the horizon. Note that this terminal cost is the same as the one in (15), except that there is no [x]− term now since there are no backlogs. We need the following notations. For n = 0,1,…, N − 1, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm051.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm042.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm043.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm052.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm044.gif?pub-status=live)
Also, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm053.gif?pub-status=live)
Note that Δn of (52) is independent of w, as earlier. This fact is important in the following analysis.
Theorem 8: Suppose the demands in each period are stochastically increasing; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm054.gif?pub-status=live)
Then
(i)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm055.gif?pub-status=live)
for n = 0,…, N − 1. Furthermore, y = Sn(w) minimizes Gn(w,y) for n = 0,…, N − 1 and Gn,N(w,y) increases with respect to y when y ≥ Sn(w).
(ii)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm045.gif?pub-status=live)
is an increasing function of y when y ≥ Sn−1(w) for a given w for n = 1,…, N − 1.
(iii)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167frm056.gif?pub-status=live)
for n = 0,…, N − 1.
The proof follows from a series of claims using backward induction.
Claim 1: Parts (i), (ii), and (iii) hold for N − 1.
Proof:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-61316-mediumThumb-S0269964807070167ffm046.jpg?pub-status=live)
It is easy to see that y = SN−1(w) = βw + FN−1−1((p − c)/(p + h − c)) minimizes GN−1,N(w,y) for all x. Hence, GN−1,N(w,y) increases with respect to y when y ≥ SN−1(w). The rest of the proof follows along the same lines as the proof of Claim 1 in the proof of Theorem 1. █
Claim 2: If parts (i), (ii), and (iii) of Theorem 1 hold for n ≤ N − 1, then they hold for n − 1.
Proof: The proof follows along the same lines as the proof of Claim 2 in the proof of Theorem 1. █
From Theorem 8 it follows that the optimal policy in period n in state (w,x) is to order up to Sn(w) as given in (51). This is called a w-dependent base stock inventory replenishment policy. Note that this policy is independent of α and δ. This is a consequence of the emergency supply assumption.
When the demands {ζn,n ≥ 0} are i.i.d. with common c.d.f. F(·), we get an optimal stationary policy that orders up to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm047.gif?pub-status=live)
in state (w,x) in any period. One can show that this policy also minimizes the infinite-horizon ETDC and also the infinite-horizon cost per period, following the same arguments in Sections 5 and 6. We can also extend the failure and the warranty expiration models along the same lines as in Section 7.
9. COMPUTATIONAL RESULTS
In this section we numerically investigate the benefits of using an integrated inventory policy over the current ad hoc policy used by the firm where they take only new demand into consideration; that is, they order up to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170224081508607-0341:S0269964807070167:S0269964807070167ffm048.gif?pub-status=live)
Although the optimal policy is known, computing its performance analytically is intractable. Hence, we use simulation to evaluate the performance of these two policies.
We compare the performance over 343 problem instances with the following parameter values: c = 2, δ = 0.96, α = 0.95. Then we vary h = 0.05, 0.1, 0.15, 0.2, 0.25, 0.30, p = 8, 10, 12, 15, 20, 25, 30, and β = 0.01, 0.05, 0.1, 0.15, 0.2, 0.25, 0.3. In these instances, we compute the total N periods (N = 100) discounted cost of the two policies and average it across 1000 simulations. In all of our experiments, we consider a stationary and uniform demand distribution over 0 to 100 items in every period. In the following passages we highlight our key insights.
Across all of these experiments, the average-cost improvement due to the integrated policy was 53.26% with a maximum improvement of 86.64% (see Tables 1, 2, and 3). For example, from Table 1 we see that when p = 8, the average improvement in the cost over all the cases with different values of h and β (given above) is 12.7%. From Figures 1 and 2 (h = 0.01) we observe the cost improvement monotonically increases with the stock-out penalty cost p and β when all other parameters are fixed. We have not plotted the improvement as a function of h, since the holding costs are not significant components of the total costs in either policy.
Average Cost Improvement over p
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-64930-mediumThumb-S0269964807070167tbl001.jpg?pub-status=live)
Average Cost Improvement over h
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-84439-mediumThumb-S0269964807070167tbl002.jpg?pub-status=live)
Average Cost Improvement over β
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-27101-mediumThumb-S0269964807070167tbl003.jpg?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-17321-mediumThumb-S0269964807070167fig001g.jpg?pub-status=live)
The cost improvement with increasing stock-out penalty cost rate p.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary-alt:20170409215242-10089-mediumThumb-S0269964807070167fig002g.jpg?pub-status=live)
The cost improvement with increasing failure rate β.
10. CONCLUSION
Motivated by the inventory planning issues faced by a seller of items under warranty, in this article we analyzed a setting in which the seller faces demand from two sources: new demand and demand to replace failed items under warranty. We considered backlogging and emergency supply cases and studied both the discounted-cost and the average-cost cases. We proved the optimality of the w-dependent base stock ordering policy where the base stock level is a function of w, the number of items currently under warranty. For the special case where an i.i.d. fraction of sold items go out of warranty every period and the demand for new products is stationary, we prove the optimality of a stationary w-dependent base stock policy for finite- and infinite-horizon cases. Through our computational study, we provide interesting insights on the benefits of using an integrated policy and show that, on average, this leads to a 53% improvement over an inventory policy that only considers new demands.
Acknowledgment
This research was partially supported by NSF grant DMI-0223117.