Abstract
This paper studies lead time flexibility in a two-stage continuous review supply chain in which the retailer uses the (R, Q) inventory system: when his inventory position reaches R, the retailer places orders with size Q to the manufacturer, who uses a transportation provider to deliver them with different lead time options. According to the contract, the manufacturer is able to expedite or postpone the delivery if the retailer makes such a request. Hence, the retailer has the flexibility to modify the lead time by using the most up-to-date demand information. The optimal lead time policy is found to be a threshold-type policy. The sensitivity analysis also shows that R is much more sensitive to the change of lead time than Q, and thus, the paper is primarily focused on finding optimal R. We also provide a cost approximation which yields unimodal cost in R. Furthermore, we analyze the order crossing problem and derive an upper bound for the probability of order crossing. Finally, we conduct an extensive sensitivity analysis to illustrate the effects of lead time flexibility on supply chain performance and discuss the managerial insights.
Similar content being viewed by others
References
Arnold JR, Chapman SN and Clive LM (2006). Introduction to Materials Management. 6th Edition. Prentice Hall, Inc: London.
Barnes-Schuster D, Bassok Y and Anupindi R (2002). Coordination and flexibility in supply contracts with options. Manufacturing & Service Operations Management 4(3):171–207.
Braglia M, Castellano D and Frosolini M (2016). A novel approach to safety stock management in a coordinated supply chain with controllable lead time using present value. Applied Stochastic Models in Business and Industry 32(1):99–112.
Chatfield D, Kim J, Harrison T and Hayya J (2009). The bullwhip effect - Impact of stochastic lead time, information quality and information sharing: A simulation study. Production Operations Management 13(4):340–353.
Chopra S, Reinhardt G and Dada M (2004). The effect of lead time uncertainty on safety stocks. Decision Science 35(1):1–24.
Disney MS, Maltz A, Wang X and Warburton RDH (2016). Inventory management for stochastic lead times with order crossovers. European Journal of Operational Research 248(2):473–486.
Duran A, Gutierrez G and Zequeira RI (2004). A Continuous review inventory model with order expediting. International Journal of Production Economics 87(2):157–169.
Fukuda Y (1964). Optimal policies for the inventory problem with negotiable lead time. Management Science 10(4):690–708.
Glock CH and Ries JM (2013). Reducing lead time risk through multiple sourcing: The case of stochastic demand and variable lead time. International Journal of Production Research 51(1):43–56.
Huggins EL and Olsen TL (2003). Supply chain management with guaranteed delivery. Management Science 49(9):1154–1167.
Jain A, Groenevelt H and Rudi N (2010). Continuous review inventory model with dynamic choice of two freight modes with fixed costs. Manufacturing & Service Operations Management 12(1):120–139.
Knoblich K, Heavey C, Ehm H and Williams P (2011). Modeling the supply contracts in semiconductor supply chains. In: IEEE Proceedings of the 2011 Winter Simulation Conference, pp. 2113–2123.
Kulkarni V and Yan K (2012). Production-inventory system in stochastic environment and stochastic lead times. Queueing System 70(3):207–231.
Lawson DG and Porteus EL (2000). Multistage inventory management with expediting. Operations Research 48(6):878–893.
Liu L and Cheung KL (1997). Service constrained inventory models with random lifetimes and lead times. Journal of the Operational Research Society 48(10):1022–1028.
Merschmann U and Thonemann UW (2011). Supply chain flexibility, uncertainty and firm performance: An empirical analysis of German manufacturing firms. International Journal of Production Economics 130(2011):43–53.
Minner S, Diks EB and De Kok AG (2003). A two-echelon inventory system with supply lead time flexibility. IIE Transactions 35(2):117–129.
Moinzadeh K and Nahmias S (1988). A continuous review model for an inventory system with two supply modes. Management Science 34(6):761–773.
Muthuraman K, Seshadri S and Wu Q (2015). Inventory management with stochastic lead times. Mathematics of Operations Research 40(2):302–327.
Pasternack B (1985). Optimal pricing and return policies for perishable commodities. Marketing Science 4(2):998–1010.
Porteus EL (2002). Foundations of Stochastic Inventory Theory. Published by Stanford University Press: Stanford, CA.
Prater E, Biehl M and Smith MA (2001). International supply chain agility: Tradeoffs between flexibility and uncertainty. International Journal of Operations & Production Management 21(5):823–839.
Robinson LW, Bradley JR and Thomas LJ (2001). Consequences of order crossover under order-up-to inventory policies. Manufacturing & Service Operations Management 3(3):175–188.
Serfozo R and Stidham S (1978). Semi-stationary clearing processes. Stochastic Process Applications 6(2):165–178.
Sethi SP, Yan H and Zhang H (2003). Inventory models with fixed costs, multiple delivery modes and forecast updates. Operations Research 51(2):321–328.
Simon RM (1968). The Uniform Distribution of Inventory Position for Continuous Review (s, Q) Policies. The RAND Corporation, P-3938.
Song J (1994). The effect of lead time uncertainty in a simple stochastic inventory model. Management Science 40(5):603–613.
Tang C and Tomlin B (2008). The power of flexibility for mitigating supply chain risks. International Journal of Production Economics 116(1):12–27.
Tagaras G and Vlachos D (2001). A periodic review inventory system with emergency replenishment. Management Science 47(3):415–429.
Tsay AA (1999). The quantity flexibility contract and supplier-customer incentives. Management Science 45(10):1339–1358.
Wang H and Yan H (2009). Inventory management for customers with alternative lead times. Production and Operations Management 18(6):705–720.
Zheng YS (1992). On properties of stochastic inventory system. Management Science 38(1):87–103.
Zipkin PH (1986a). Inventory service-level measures: Convexity and approximation. Management Science 32(8):975–981.
Zipkin PH (1986b). Stochastic lead times in continuous time inventory models. Naval Research Logistics Quarterly 33(4):763–774.
Zipkin PH (2002). Foundations of Inventory Management. McGraw-Hill Higher Education: Boston.
Acknowledgements
Sirong Luo’s research is supported by National Natural Science Foundation of China (NSFC-71471107) and Shanghai Pujiang Program (12PJC051), and in part by the State Key Program in the Major Research Plan of National Natural Science Foundation of China (Grant Number 91546202) and Innovative Research Team of Shanghai University of Finance and Economics (IRTSHUFE-13122402).
Author information
Authors and Affiliations
Corresponding author
Appendix: Proofs of lemmas
Appendix: Proofs of lemmas
Proof of Lemma 1
For (i), see Zheng (1992) and Zipkin (1986a). (ii) From (1) and \({\mathbbm {E}}[(D(T)-y)^+]=\int _0^{\infty } P (D(T)-y \ge x)\mathrm{d}x=\int _y^{\infty } P (D(T) \ge x)\mathrm{d}x\),
Since D(T) is stochastically increasing in T, \(\nabla _1 G(y,T)\) nonincreasing in T: \(\nabla _{12} G(y,T) \le 0\). Similarly,
We complete the proof for part (ii). \(\quad\square \)
(iii) We show that B(R, Q, T) is convex in T by first establishing the convexity of \(E[D(T)-y]^+\). Note that
For arbitrarily given y and \(T \ge 0\), locally define
where d(T) and \(d(\delta )\) are observations from D(T) and \(D(\delta )\). Note that \(h(x,\delta )=0\) for \(x \le -d(T)-d(\delta )+y\), it increases with a slope of one between \(-d(T)-d(\delta )+y\) and \(-d(T)+y\), and \(h(x,\delta )=d(\delta )\) for \(x \ge -d(T)+y\). Consequently, \(h(x,\delta )\) is a nondecreasing function which implies that \(H(x,\delta )\) below is nondecreasing as well.
By using the fact that \(D(\varepsilon )\) is stochastically greater than \(D(\varepsilon )=0\), we obtain \(E H(x=D(\varepsilon ),\delta ) \ge E H(x=0,\delta )\) for every \(\epsilon , \delta >0\). Dividing this inequality by \(\delta \) and taking limits, we arrive at
Finally, the last inequality is the definition of the convexity of \(E(D(T)-y)^+\) in T. This implies the convexity of B(R, Q, T) by (3). \(\quad\square \)
Proof of Theorem 1
Let \(I=R-d(\tau )\) and define \(\varDelta (I)\) representing the cost difference per unit time when the lead time \(T+\beta \) is used instead of T. It follows from (8) that
which can be rewritten by using (2)
Then, the first derivative is
Since the demand during the lead time is stochastically increasing with lead time, the integrand is negative so \(\nabla \varDelta (I) \le 0\). Note that \(\varDelta (I=-Q)= b\mu \beta > 0\). When inventory level \(I \rightarrow \infty \), \(\varDelta (I)=-h\mu \beta < 0\). By monotonicity and continuity of \(\varDelta (I)\), there is an \(I'\) such that \(\varDelta (I')=0\). Let \(\bar{I}=\min \{I',R\}\). By construction for \(R-d(\tau ) \ge \bar{I}\), \(C(R-d(\tau ),Q,T-\tau ) \ge C(R-d(\tau ),Q,T-\tau +\beta )\) and the retailer exercises the lead time option by using \(T+\beta \) as opposed to T. Similarly, we can argue that there exists \(\underline{I}\), such that when \(R-d(\tau ) \le \underline{I}\) the retailer should use \(T-\alpha \) instead of T.
We now show that \(\underline{I} \le \bar{I}\). Suppose to the contrary that \(\underline{I} > \bar{I}\). For \(\bar{I}< I <\underline{I}\),
These inequalities contradict the convexity of C(I, Q, T) in T. \(\quad\square \)
Proof of Lemma 2
Argument for \(\bar{I}\) is presented. Let \(\Theta (y):=E[(D(T-\tau +\beta )-y)^+]-E[(D(T-\tau )-y)^+]\). Set \(\nabla \varDelta (I)=0\) and rearrange to obtain
Taking the implicit derivative of (21) with respect to Q
Since \(\Theta (y)\) is decreasing in y,
which in combination with the implicit derivative yields
\(\quad\square \)
Proof of Lemma 3
(i) and (ii) follow, respectively, from \(\nabla _{13} C(R,Q,T) \le 0\) and \(\nabla _{23} C(R,Q,T) \le 0\), and the convexity of C(R, Q, T) in R and Q, see Lemma 1.
(iii) We provide a constructive proof. Let R(T) to denote the optimal reorder point corresponding to lead time T. Consider three (R, Q) inventory systems, parameterized for an arbitrary \(\tau \ge 0\) as follows.
System 1: Lead time \(T+\tau \) and reorder point \(R(T+\tau )\). System 2: Lead time T and reorder point \(R(T+\tau )\), but release orders \(\tau \) time after IP reaches \(R(T+\tau )\). System 3: Lead time T, use reorder point R(T).
Clearly, the costs of system 1 and 2 are the same: \(C(R(T+\tau ),Q,T+\tau )\). In system 2, we delay an order by \(\tau \) time and release at \(IP'=R(T+\tau )-D(\tau )\). \(C(IP',Q,T) \ge C(R(T),Q,T)\), because R(T) is optimal with respect to T. Then, by using (4), \(C(R(T+\tau ),Q,T+\tau )= E_{D(\tau )}C(R(T+\tau )-D(\tau ),Q,T) \ge C(R(T),Q,T)\) which implies \(\min _R C(R,Q,T+\tau ) \ge \min _R C(R,Q,T)\).
(iv) First write the optimality equation for R and Q as
By taking the implicit derivative of the optimality equations for R and Q with respect to T, we obtain two simultaneous equations. After some rearrangement of the implicit derivatives obtained from each equation, we, respectively, obtain
Using the last equation, we obtain
By \(\nabla _{1,2} G(y,T) \le 0\) of Lemma 1, \(\{ \nabla _2 G(y,T)-\nabla _2 G(R,T) \} \le 0\) and \(\{ \nabla _2 G(y,T)-\nabla _2 G(R+Q,T) \} \ge 0\) for \(R \le y \le R+Q\). On the other hand, G(y, T) is convex in y and \(G(R,T)=G(R+Q,T)\). Then, \(\nabla _1 G(R,T) \le 0 \le \nabla _1 G(R+Q,T)\). Thus, we establish that the numerator and the denominator have the same signs in \(\mathrm{d}R/\mathrm{d}T\) and \(\mathrm{d}(R+Q)/\mathrm{d}T\) expressions above. This gives us the desired result that both R and \(R+Q\) are nondecreasing in T. \(\quad\square \)
Proof of Lemma 4
The first part of the claim follows from the definitions of \({\bar{C}}^1_{\tau }\), \({\bar{C}}^2_{\tau }\) and \({\bar{C}}^3_{\tau }\). For the second part, we need to argue that each of \({\bar{C}}^i_{\tau }\) for \(1 \le i \le 4\) is unimodal. Consider Case 1 only. For \(I \le \underline{I}\), the approximated cost is \(\max \{C(I,Q,T-\tau -\alpha ), C(\underline{I},Q,T-\tau -\alpha )\}\). Since \(C(I,Q,T-\tau -\alpha )\) is convex in I, the approximated cost is nonincreasing over \(I \le \underline{I}\) and is exactly \(C(\underline{I},Q,T-\tau -\alpha )\) at \(I=\underline{I}\). For \(\underline{I} \le I \le \bar{I}\), the approximated cost is convex in I. For \(I \ge \bar{I}\), the approximated cost is \(\max \{C(I,Q,T-\tau +\beta ), C(\bar{I},Q,T-\tau +\beta )\}\), and it is nondecreasing and takes the value \(C(\bar{I},Q,T-\tau +\beta )\) at \(I=\bar{I}\). We see that \(C^1_{\tau }(I,Q,T)\) is constructed by patching a nonincreasing, a convex and a nondecreasing function together and it is continuous. Then, \(C^1_{\tau }(I,Q,T)\) must be unimodal.
We next consider Case 4 where \({\bar{C}}^4_{\tau }(I)=C_{\tau }(I,Q,T)\). For \(I \le \underline{I}\), the cost is \(C(I,Q,T-\tau -\alpha )\) and is convex. For \(\underline{I} \le I \le \bar{I}\), the cost is \(C(I,Q,T-\tau )\) and it is nondecreasing because \(I(T-\tau ) \le \underline{I}\). Similarly, for \(I \ge \bar{I}\), the cost is \(C(I,Q,T-\tau +\beta )\) and it is nondecreasing because \(I(T-\tau +\beta ) \le \bar{I}\). The cost is first convex and then nondecreasing in I so it must be unimodal. The proof for Case 2 and Case 3 requires a combination of the arguments for Cases 1 and 4. \(\quad\square \)
Proof of Lemma 5
By the definition of the approximate cost
In addition, using unimodality of \({\bar{C}}_{\tau }(I,Q,T)\) in I, \(PF_2\) property for the demands and Theorem 9.1 of Porteus (2002), we establish the unimodality of \({\bar{C}}_F(R,Q,T;\alpha ,\beta ,\tau )\). \(\quad\square \)
Proof of Theory 2
In case of (i) and (ii), the first inequality is due to switching from deterministic to stochastic demand. The second and the third inequalities are, respectively, by Lemma 5. The argument for (iii) is the same except that \(C_F({\bar{R}}^*,{\bar{Q}}^*,T; \alpha , \beta , \tau ) > \min _{R,Q} C(R,Q,T)\) is very unlikely but possible. Therefore, we have only three inequalities as opposed to four in (i) and (ii). \(\quad\square \)
Proof of Lemma 6
First recall from (8) that
Then, using (4),
Repeating the last argument for every term in the minimization in (22), we obtain
Taking the expected value over \(D(\tau _1)\) of the both sides establishes the result. \(\quad\square \)
Proof of Lemma 7
(i) In order for the nth order to cross the \(n+1\)st, \(t_n \le t_{n+1} \le t_n+\alpha +\beta \). We show that the probability in the statement of the lemma increases in \(t_{n+1}\).
For \(t_{n+1} \ge t_n+\tau \), define \(r_1=R-{\bar{I}}\) and \(r_2=R-\underline{I}\), we have:
It is clear from the last equality that the probability increases in \(t_{n+1}\).
Consider \(t_{n+1} < t_n+\tau \). For a small and fixed \(\epsilon >0\), define the following independent random variables for convenience:
It suffices to argue that
Now condition on \(X_1=x_1\), \(X_3=x_3\) and \(X_4=x_4\).
where we use the fact that \(X_2\) and \(X_5\) are i.i.d. and \(P (X_2 \le r_1-x_1-x_3) \le 1\). Finally taking the expected values over \(X_1\), \(X_3\) and \(X_4\) yields the desired result.
(ii) Using part (i) with \(r_1=R-{\bar{I}}\) and \(r_2=R-\underline{I}\),
Note that the demand is stationary and then consider two cases.
Case 1: \(0 \le \tau \le \alpha +\beta \).
where the inequality is due to the implication between two events below
Case 2: \(0 \le \alpha +\beta \le \tau \).
The first inequality follows from increasing \(\alpha +\beta \) up to \(\tau \) so that the dependence between the events \([D(0,\tau ) \le R-\bar{I}]\) and \([D(\alpha +\beta ,\alpha +\beta +\tau ) \ge R-\underline{I}]\) is eliminated. This inequality can be argued formally as in part (i) of the lemma. The second inequality follows from the case condition \(\alpha +\beta \le \tau \). Combining two cases, we prove (ii). \(\quad\square \)
Rights and permissions
About this article
Cite this article
Çakanyildirim, M., Luo, S. Stochastic inventory system with lead time flexibility: offered by a manufacturer/transporter. J Oper Res Soc 68, 1533–1552 (2017). https://doi.org/10.1057/s41274-016-0172-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/s41274-016-0172-5