Abstract
We consider joint capacity–inventory management for multi-server make-to-stock queues operating under a base stock policy. The number of servers corresponds to the capacity decision, and the base stock level is the inventory decision. Our goal is to minimize a combination of capacity, inventory, and backordering costs. We develop a square-root rule for the joint decision and justify the rule analytically in a many-server queue asymptotic framework. We demonstrate the accuracy of the square-root rule, first via our derivation and numerical assessment of a novel corrected diffusion approximation and then more directly by conducting extensive numerical experiments. Finally, we provide operational insights into the trade-offs involved in such joint management problems, through various analysis based on the square-root rule as well as a comparison with analogous results for single-server make-to-stock queues.
Similar content being viewed by others
Notes
In general, the bivariate exact and approximate cost objective functions may not be jointly convex and a numerical optimum search method does not guarantee finding a global minimum. The default method for the Wolfram Mathematica function NMinimize chooses an algorithm (among, for example, differential evolution, Nelder–Mead) based on the specific problem instance; see [43] for more details on the algorithms.
References
Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York (1964). http://www.math.ucla.edu/~cbm/aands/
Allon, G., Zeevi, A.: A note on the relationship among capacity, pricing, and inventory in a make-to-stock system. Prod. Oper. Manag. 20(1), 143–151 (2011)
Angelus, A., Porteus, E.: Simultaneous capacity and production management of short-life-cycle, produce-to-stock goods under stochastic demand. Manag. Sci. 48(3), 399–413 (2002)
Ata, B., Rubino, M.: Dynamic control of a make-to-order, parallel-server system with cancellations. Oper. Res. 57(1), 94–108 (2009)
Bassamboo, A., Randhawa, R.S., Zeevi, A.: Capacity sizing under parameter uncertainty: safety staffing principles revisited. Manag. Sci. 56, 1668–1686 (2010)
Benjaafar, S., ElHafsi, M., Véricourt, F.D.: Demand allocation in multiple-product, multiple-facility, make-to-stock systems. Manag. Sci. 50, 1431–1448 (2004)
Borst, S., Mandelbaum, A., Reiman, M.: Dimensioning large call centers. Oper. Res. 52, 17–34 (2004)
Bradley, J., Glynn, P.: Managing capacity and inventory jointly in manufacturing systems. Manag. Sci. 48(2), 273–288 (2002)
Brothers, H.J., Knox, J.A.: New closed-form approximations to the logarithmic constant e. Math. Intell. 20(4), 25–29 (1998)
Browne, S., Whitt, W., Dshalalow, J.: Piecewise-linear diffusion processes. Adv. Queueing Theory Methods Open Probl. 4, 463–480 (1995)
Buyukkaramikli, N., Bertrand, J., van Ooijen, H.: Flexible hiring in a make to order system with parallel processing units. Ann. Oper. Res. 209(1), 159–178 (2013)
Buyukkaramikli, N., van Ooijen, H., Bertrand, J.: Integrating inventory control and capacity management at a maintenance service provider. Ann. Oper. Res. 1–22 (2013)
Caldentey, R.: Analyzing the Make-to-Stock Queue in Supply Chain and e-Business Settings. Ph.D. Thesis (2001)
Caldentey, R., Wein, L.: Analysis of a decentralized production-inventory system. Manuf. Serv. Oper. Manag. 5(1), 1–17 (2003)
Durrett, R.: Probability: Theory and examples. Online book (2010). http://www.math.duke.edu/~rtd/PTE/PTE4_Jan2010.pdf
Eberly, J., Van Mieghem, J.: Multi-factor dynamic investment under uncertainty. J. Econ. Theory 75(2), 345–387 (1997)
Garnett, O., Mandelbaum, A., Reiman, M.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4, 208–227 (2002)
Glasserman, P.: Bounds and asymptotics for planning critical safety stocks. Oper. Res. 45(2), 244–257 (1997)
Gross, D., Harris, C.M.: Fundamentals of Queueing Theory, 3rd edn. Wiley, London (1998)
Gurvich, I.: Validity of heavy-traffic steady-state approximations in multiclass queueing networks: the case of queue-ratio disciplines. Math. Oper. Res. 39(1), 121–162 (2014)
Gurvich, I., Huang, J., Mandelbaum, A.: Excursion-based universal approximations for the Erlang-A queue in steady-state. Math. Oper. Res. 39(2), 325–373 (2013)
Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29, 567–588 (1981)
Jagers, A., van Doorn, E.: On the continued erlang loss function. Oper. Res. Lett. 5(1), 43–46 (1986)
Janssen, A., van Leeuwaarden, J., Zwart, B.: Refining square root safety staffing by expanding Erlang C. Oper. Res. 59(6), 1512–1522 (2011)
Jodlbauer, H., Altendorfer, K.: Trade-off between capacity invested and inventory needed. Eur. J. Oper. Res. 203(1), 118–133 (2010)
van Leeuwaarden, J.S., Knessl, C.: Transient behavior of the Halfin–Whitt diffusion. Stoch. Process. Appl. 121(7), 1524–1545 (2011)
Mandelbaum, A., Zeltyn, S.: Staffing many-server queues with impatient customers: constraint satisfaction in call centers. Oper. Res. 57(5), 1189–1205 (2009)
Mincsovics, G., Tan, T., Alp, O.: Integrated capacity and inventory management with capacity acquisition lead times. Eur. J. Oper. Res. 196(3), 949–958 (2009)
Morse, P.: Queues, Inventories, and Maintenance: The Analysis of Operational Systems with Variable Demand and Supply. Wiley, London (1958)
Nahmias, S.: Production and Operations Analysis. McGraw-Hill/Irwin, New York (2009)
Plambeck, E., Zenios, S.: Incentive efficient control of a make-to-stock production system. Oper. Res. 51, 371–386 (2003)
Rao, M.: Optimal capacity expansion with inventory. Oper. Res. 24(2), 291–300 (1976)
Reed, J.: The G/GI/N queue in the Halfin–Whitt regime. Ann. Appl. Prob. 19(6), 2211–2269 (2009)
Tayur, S.: Computing the optimal policy for capacitated inventory models. Stoch. Models 9(4), 585–598 (1993)
Tijms, H.C.: Stochastic Models: An Algorithmic Approach. Wiley, London (1995)
Van Mieghem, J., Rudi, N.: Newsvendor networks: inventory management and capacity investment with discretionary activities. Manuf. Serv. Oper. Manag. 4(4), 313–335 (2002)
Wein, L.M.: Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40, 724–735 (1992)
Whitt, W.: Understanding the efficiency of multi-server service systems. Manag. Sci. 38(5), 708–723 (1992)
Whitt, W.: The Erlang B and C Formulas: Problems and Solutions. Class notes (2002). http://www.columbia.edu/~ww2040/ErlangBandCFormulas.pdf
Wikipedia: Incomplete Gamma Function—Wikipedia, The Free Encyclopedia. http://en.wikipedia.org/wiki/Incomplete_gamma_function (2014). Accessed 2 Aug 2014
Wolff, R.W.: Poisson arrivals see time averages. Oper. Res. 30(2), 223–231 (1982)
Wolfram, W.: Wolfram Language and System Documentation Center: NMinimize. https://reference.wolfram.com/language/ref/NMinimize.html (2016). Accessed 10 Apr 2016
Wolfram, W: Wolfram Language and System Documentation Center: Numerical Nonlinear Global Optimization. http://reference.wolfram.com/language/tutorial/ConstrainedOptimizationGlobalNumerical.html (2017). Accessed 15 Jan 2017
Zhang, B., van Leeuwaarden, J., Zwart, B.: Staffing call centers with impatient customers: refinements to many-server asymptotics. Oper. Res. 60(2), 461–474 (2012)
Zhang, B., Zwart, B.: Steady-state analysis for multi-server queues under size-interval task assignment in the quality-driven regime. Math. Oper. Res. 38(3), 504–525 (2013)
Zhang, J., Zwart, B.: Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Syst. 60(3–4), 227–246 (2008)
Zipkin, P.: Foundations of Inventory Management. McGraw-Hill, New York (2000)
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Preliminary results
In the appendices, we provide the proofs of the results found in the paper. We begin with some preliminary results with regard to the analytic continuation of various performance functions. As discussed in Sect. 3.2, we consider the continuous extension of each performance function, allowing c and s to take on any nonnegative real value. The same approach is taken in [24, 44] and is based on results from earlier work such as [23].
First, the continuation of the steady-state shortfall distribution to real-valued arguments is given by the following lemma.
Lemma 2
For any \(c\in \mathbb {Z}_{+}\cup (R,\infty )\) and \(s\in \mathbb {Z}_{+}\), \(D(c,s,R)=\mathbb P_{c}\{Q(\infty )\le s\}\), where D(c, s, R) is defined for all \(c\in (R,\infty )\) and \(s\in [0,\infty )\):
with
Proof
For any integer \(c>R\), the analytic continuation of the Erlang C formula reads (see [24]):
and therefore
For any \(s\in \mathbb {Z}_{+}\cup [0,c]\), it follows from the exact formula for the distribution of \(Q(\infty )\) that
Multiplying (46) by (47) yields the desired result for \(s\le c\). In the case of \(s>c\), we have that
which combined with (46) completes the proof. \(\square \)
We next show that a recursive relation that is known to hold for the Erlang B loss formula (see [39]) remains valid for its analytic continuation.
Lemma 3
For any \(x>0\),
Proof
The recursion follows from
and a recursive relation for the incomplete gamma function (see [40]):
\(\square \)
Our third preliminary result is the continuation for the two performance functions that determine the inventory holding cost and backorder cost.
Lemma 4
If \(c\ge s\), \(\mathbb E_{c}[(s-Q(\infty ))^{+}]=L_{1}(c,s,R)\), and if \(c\le s\), \(\mathbb E_{c}[(Q(\infty )-s)^{+}]=L_{2}(c,s,R)\), where
and both functions are defined for all \(c\in (R,\infty )\) and \(s\in [0,\infty )\).
Proof
First, by examining the state transition rates in the underlying birth-death process of the total number of customers in the M / M / c queue, we observe that, if \(c\ge s\), \(Q(\infty )|Q(\infty )\le s\) is equal in distribution to \(Q_{B}\), where \(Q_{B}\) denotes the steady-state number of customers in the M / M / s / s loss queue with offered load R, and if \(c\le s\), \(Q(\infty )-s|Q(\infty )\ge s\) equal in distribution to \(Q_{\mathrm{M/M/1}}\), where \(Q_{\mathrm{M/M/1}}\) denotes the steady-state number of customers in the M / M / 1 queue with traffic intensity \(\rho \).
If \(c\ge s\), we condition to obtain that
Substituting the formula for the expected steady-state queue-length in the M / M / s / s queue,
In the case of \(c\le s\),
because
due to
\(\square \)
We further note that
Also, since
we then have
Therefore, combining (54) and Lemma 4, we can have the continuation function for \(\mathbb E_{c}[(s-Q(\infty ))^{+}]\) and \(\mathbb E_{c}[(Q(\infty )-s)^{+}]\), regardless of whether c is greater than or less than s, and this eventually leads to the continued expression of \(\varOmega (c,s,R)\).
Proposition 2
For any \(c\in \mathbb {Z}_{+}\cup (R,\infty )\) and \(s\in \mathbb {Z}_{+}\), \(\varOmega (c,s,R)=\varPi (c,s,R)\), where
Proof
The representation simply follows by applying (54) and Lemma 4 to (4). We provide the details below.
If \(s\le c\),
and if \(s>c\),
\(\square \)
Appendix 2: Diffusion approximation for the average cost function
In this section we provide the proof of Theorem 1.
Proof of Theorem 1
Throughout the proof, let \(c:=R+\beta \sqrt{R}\) and \(s:=R+b\sqrt{R}\). Due to Proposition 2, the desired result is equivalent to
First, [24] shows that
and
where
a simple function of R and s with \(\alpha _{s}\rightarrow b\) as \(s\rightarrow \infty \). Inverting (62) yields
Simple calculations show that
and
Applying (65) and (66) to (64), we have that
We then apply (67) and Proposition 1 to (49) and get that
On the other hand, expression (67) implies
Also,
Applying (70), (71), (61), and \(\rho (1-\rho )^{-1}=\beta ^{-1}R^{1/2}\) to (50), we can obtain that
Finally, substituting (61), (69), and (72) into (58) and (59) leads to (60). \(\square \)
Appendix 3: Asymptotic optimality of square-root rule
This section is mainly devoted to the proof of Theorem 2. We also provide the proof of Lemma 1.
Proof of Theorem 2
Since the cost function \(\varPi \) is continuous, the asymptotic optimality of the cost objective function (21) follows directly from that of the decision variables (20). Therefore, it suffices to prove (20). We first note that by Proposition 2, the exact optimal solution pair \((c_{\mathrm{opt}},s_{\mathrm{opt}})\) must satisfy
in which the second component is equivalent to
From (73), (74), (60), and Proposition 1, we have that
Let \(g_{1,*}(R):=\beta _{\mathrm{opt}}-\beta _{*}\) and \(g_{2,*}(R):=b_{\mathrm{opt}}-b_{*}\). Then applying a first-order Taylor expansion to (75), we obtain that
Finally, substituting \(D_{*}(\beta _{*},b_{*})=\frac{p}{p+h}\) into (77), we find that \(\max \{g_{1,*}(R),g_{2,*}(R)\}=\mathcal {O}({R}^{-1/2})\), and therefore (19) holds, which immediately yields (20) in light of the definition of \((c_*,s_*)\) and that of \((\beta _{\mathrm{opt}},b_{\mathrm{opt}})\). \(\square \)
Proof of Lemma 1
The first part of the lemma simply follows by applying to (10) the result \(\lim _{\beta \rightarrow \infty }\beta [\phi (\beta )+\beta \varPhi (\beta )]^{-1}=1\), which can be easily verified algebraically. For the second part, setting to \(\delta \) the expression (10) for \(\beta <b\), we solve for b and obtain that
Then note that
where a function \(f(\beta )\) is said to be \(o(\beta )\) if \(\lim _{\beta \rightarrow 0}f(\beta )/\beta =0\). Finally, the second part of the lemma follows after first applying (79) to (78) and then subsequently using the fact that \(\ln (1+x)=x+o(x)\) for \(|x| < 1\) (with x corresponding to \(-\frac{\sqrt{2\pi }}{2}\beta +o(\beta )\) in this case). \(\square \)
Appendix 4: Corrected diffusion approximation
In this section we prove Theorem 3, i.e., the corrected diffusion approximation for the steady-state shortfall distribution, which is equivalent to the steady-state queue-length distribution in the elementary M / M / c queue. This corrected diffusion approximation refines the celebrated diffusion approximation first developed in Propositions 1 and 2 of [22] and may be of independent interest.
Proof of Theorem 3
Throughout the proof, let \(c:=R+\beta \sqrt{R}\) and \(s:=R+b\sqrt{R}\). By Theorem 2 in [24],
We first consider the case of \(s\le c\) or \(b\le \beta \). Due to (43) and (80), it is sufficient to prove
In [24], it is shown that
where
a simple function of R and s with \(\alpha _{s}\rightarrow b\) as \(s\rightarrow \infty \). By letting \(p(s):=s^{s}\mathrm{e}^{-s}\sqrt{2\pi s}~\varGamma (s+1)^{-1}\), we have
Multiplying (82) by (84) yields
To expand the first term in (85), we note from the proof of Theorem 2 in [24] that
and thus
By Stirling’s approximation for the Gamma function (see p. 257 of [1]),
We then multiply (86) by (87) and arrive at
Next, we expand the second term in (85). Simple computations show that
and
It then follows that
Substituting (88) and (89) into (85) yields
This provides a power series expansion of the numerator in (81) times \(\mathrm{e}^{-R}\). We then turn to expanding the denominator of expression (81) times \(\mathrm{e}^{-R}\). By Lemma 3,
and therefore
The expansion of the first term of (91) is just the same as (90), with b replaced by \(\beta \):
For the second term of (91), following the same procedure as above [i.e., from (84) to (89)], we obtain that
Substituting (92) and (93) into (91) yields
which upon inversion becomes
Finally, we multiply (90) by (94) to get (81). This completes the proof for the case of \(b\le \beta \). We now turn to proving the theorem in the case of \(b>\beta \). First, by Lemma 3 and (82) (with s replaced by c),
which upon inversion becomes
Simple computations show that
and
Applying (98)–(100) to (97), we have that
Next, we derive a refined approximation for \(\rho ^{s-c+1}\). We shall need the following result (see [9]): for any \(x<-1\),
Also, we can express the traffic intensity as
Applying (102) and the two expressions in (103), we have that
Combining (104) with (103) yields
Finally, substituting (80), (101), (105) and \(\rho (1-\rho )^{-1}=\beta ^{-1}R^{1/2}\) into (43), we obtain the desired series expression in the case of \(b>\beta \) and complete the proof of the theorem. \(\square \)
Rights and permissions
About this article
Cite this article
Reed, J., Zhang, B. Managing capacity and inventory jointly for multi-server make-to-stock queues. Queueing Syst 86, 61–94 (2017). https://doi.org/10.1007/s11134-017-9519-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-017-9519-0
Keywords
- Make-to-stock queue
- Joint capacity–inventory management
- Multi-server queue
- Many-server asymptotics
- Square-root rule
- Diffusion approximation