1 Introduction

A queueing-inventory system (QIS) is a queueing system with attached inventory in which customers arrive one by one and need not only an on-hand item but also some form of time-consuming service. For example, items in inventory require time for retrieval, preparation, packing, and loading (see Saffari et al. 2011). Compared to the traditional inventory system, a QIS is more general and realistic. Over the past decades, research on QIS has attracted significant research attention due to its wide-ranging applications in such fields as integrated supply chain management, vehicle maintenance and medical services (see Schwarz et al. 2006; Krishnamoorthy et al. 2016a; Arun 2010).

It seems that the first contribution to QIS research was the work done by Sigman and Simchi-Levi (1992) and Melikov and Molchanov (1992) where the analyses were carried out under the assumptions of an arbitrarily distributed service time in Sigman and Simchi-Levi (1992) and an exponentially distributed service time in Melikov and Molchanov (1992). Sigman and Simchi-Levi (1992) investigated an M/G/1 QIS model, where it was assumed that customers arriving at the system during an out-of-stock period were backlogged. In the literature on inventory systems, these customers are referred to as backorders. Sigman and Simich-Levi proposed a light traffic heuristic approximation procedure to derive performance for their model. Melikov and Molchanov (1992) considered a QIS in a transportation/storage system (TSS), where a user request is lost if the request arrives when the system already contains the maximum number N of user requests. The exact and approximate solution methods were proposed. Subsequently, many research papers on QIS models with backorders were presented. We refer to the survey paper by Krishnamoorthy et al. (2011) for more details on this topic.

Another aspect of QIS research has been on the lost sales model. In this model, it is assumed that customers arriving at the system during an out-of-stock period are lost. Many research papers on QIS with lost sales have been published. A special mention should be paid to the paper by Schwarz et al. (2006) who studied an M/M/1 QIS model under three different inventory management policies including random order size (ROS) policy, (rQ) inventory policy and (sS) inventory policy, respectively. The authors derived a product form solution for the stationary joint probability of the queue length and the inventory level by using the probability generating function method. This solution is special because a strong correlation exists between the number of customers joining the system during the lead time and the number of items in the inventory over that period. Krishnamoorthy and Viswanath (2013) subsumed the work in Schwarz et al. (2006) to a (sS) production inventory model with an M/M/1 service queue where the inventory items were gradually replenished by an internal production process. They obtained the production form solution for the system state distribution in steady state by using a matrix theoretical approach. Baek and Moon (2014) studied a production-inventory system with an M/M/1 service queue and lost sales where the stocks were replenished by both an external order under (rQ) policy and an international production. They derived the stationary joint distribution of the queue length and the on-hand inventory in product form.

Melikov et al. (2016) considered an M/M/1 QIS model with either a finite or an infinite queue of impatient customers, where ROS policy was considered. The exact and approximate methods to calculate the characteristics of the systems under given lead policies were developed. Melikov et al. (2017) further considered a Markovian QIS model with impatient customers and a variable size of order policy in which the size of the order is dependent on the on-hand inventory level. The exact and approximate methods were developed to calculate the characteristics of the systems under a proposed restocking policy. For other QIS research that includes either (rQ) inventory policy or (sS) inventory policy or both, we refer to a spate of research papers including Saffari et al. (2011, 2013), Krenzler and Daduna (2015), Krishnamoorthy et al. (2015, 2016b), Yue et al. (2018), Barron (2019) and several others.

Queueing systems with server vacations have been extensively applied in many fields such as communication systems, manufacturing systems, call centers, and production inventory systems. We refer to Doshi (1986), Takagi (1991), Tian and Zhang (2006) and Ke et al. (2010) for more details on this topic. However, there has been only limited research into QIS that considers server vacations. Viswanath et al. (2008) introduced server vacations into a QIS with a (sS) inventory policy, where the customers who waited for service may renege after a period of random time. They computed the steady-state probabilities by using the level dependent quasi-birth-and-death (QBD) process theory. Sivakumar (2011) studied an M/M/1 QIS model with multiple server vacations and a (sS) inventory policy, where the demands that occurred during an out of stock period and/or during a server vacation period entered the orbit of infinite size. They obtained the joint probability distribution of the inventory level and the number of customers in the orbit in the steady-state case. Various performance measures and the long run expected total cost rate were calculated.

Recently, Padmavathi et al. (2016) investigated a finite-source inventory system with postponed demands and a modified vacation policy, where a (sS) inventory policy was considered. The vacation time and the lead time followed independent PH distributions. The joint distribution of the mode of the server, the server status, the inventory level, and the number of demands in the pool were obtained in the steady-state. Melikov et al. (2017) proposed a model for a servicing system with perishable inventory and a finite queue of impatient claims where a (sS) inventory policy was considered, and the server could be in one of three states: operational, early and delaying vacations. They developed a method to approximately compute the system’s characteristics. Koroliuk et al. (2017, 2018) proposed Markov QIS models with perishable inventory and a (sS) inventory policy. Koroliuk et al. (2017), it was assumed that the server took vacations if either the inventory level was zero, the queue was empty, or both. Unlike in Koroliuk et al. (2017), it was assumed in Koroliuk et al. (2018) that the server took a vacation only if there were no customers in the system at the moment its operation completed, and the server returned to operating mode only when the number of customers in the system exceeded some thresholds. In these studies, they developed an exact and an approximate method to find the system’s characteristics. Jeganathana and Abdul (2020) considered a two-server Markovian inventory system with modified and delayed working vacations, where a (sQ) inventory policy was considered. The various measures of system performance in the steady state were obtained.

To the best of our knowledge, the two papers by Schwarz et al. (2006) and Melikov et al. (2016) are the only papers that considered the ROS policy in M/M/1 QIS models in which when the inventory was depleted after the service of a customer was completed, a random order size that followed a discrete probability distribution was instantaneously triggered.

In this paper, we consider an M/M/1 QIS with lost sales and ROS policy by taking into account the server’s multiple vacations. When the server finishes the service of a customer and finds the inventory is empty, the server leaves for a vacation. If the server finds that the inventory is empty at the end of a vacation, he/she takes another vacation immediately and continues in the same manner until the server finds the inventory is not empty.

The purpose of this paper is to investigate the following research questions: (a) Does the stationary joint distribution of the queue length, the on-hand inventory level, and the status of the server have a simple product form for the marginal distributions? (b) How does the conditional on-hand inventory level when the server is off due to a vacation differ from the conditional on-hand inventory level when the server is on and working? (c) How does the server’s vacation influence the on-hand inventory level and the other performance measures of the system? (d) How does the distribution of random order size influence the performance measures of the system?

The main research contributions of this paper are as follows: (a) We develop a new M/M/1 QIS model with ROS policy by taking into account the server vacation. (b) We derive the stationary joint distribution of the queue length, the on-hand inventory level and the status of the server in product form by using a matrix analytical approach. (c) We obtain the conditional distributions and the conditional expectations of the on-hand inventory level when the server is off due to a vacation or depleted inventory, and when it is on and working. (d) We compute explicitly some performance measures and analytically investigate the effect of the parameter of the server’s vacation on these performance measures.

The rest of the paper is organized as follows. We describe the system model in Sect. 2. In Sect. 3, we first derive the stability condition of the system by using a QBD process theory. Then, we derive the stationary joint distribution of the queue length, the on-hand inventory level, and the status of the server. We further investigate the conditional distributions of the on-hand inventory level when the server is off due to a vacation or depleted inventory and when it is on and working. Some performance measures are computed and compared with the model shown in Schwarz et al. (2006) for ROS policy in Sect. 4. The effect of the vacation rate on the performance measures is also investigated analytically in this section. Some numerical results are presented in Sect. 5. In Sect. 6, we perform a simulation study for the case of more general distributions of the inter-arrival times and the service times. In Sect. 7, we present some managerial suggestions. Conclusions are given in Sect. 8.

2 Description of the model

In this section, we describe the proposed model in more detail. Figure 1 shows the schematic diagram of the proposed model.

We consider an M/M/1 QIS under continuous review with ROS policy and multiple server vacations. Customers arrive in the system according to a Poisson process with rate \(\lambda \). Each customer requires one unit of an item and is served by a single server under a First-Come, First-Service (FCFS) discipline. The service time follows an exponential distribution with rate \(\mu \).

The item for a customer is counted in the inventory until the end of service for that customer. A served customer departs immediately from the system and the on-hand inventory decreases by one at the moment of service completion. If the server is ready to serve a customer which is at the head of the line and there is no item of inventory, this service starts only at the time instant when the next replenishment arrives at the inventory.

When the server finishes serving of a customer and finds the inventory is empty, the server leaves for a vacation that follows an exponential distribution with parameter \(\theta \). If the server finds that the inventory is not empty at the end of a vacation, the server returns from the vacation and serves any customers waiting for service. If the server finds that the inventory is still empty at the end of a vacation, the server takes another vacation immediately and continues in the same manner until the server finds the on-hand inventory is not empty.

Considering ROS policy, once the inventory is depleted after the service of a customer is completed, a random order size D that follows a discrete probability distribution on integers \(E=\{1,2,\ldots ,M\}\) is instantaneously triggered. The size D of the replenishment order is k with the probability \(p_k\), where \(\sum _{k=1}^{M}p_k=1\). The corresponding distribution function is denoted by \(F_p\). The mean order size is denoted by \({\overline{p}}\). Let \(q_k\) be the probability that the size of a replenishment order is at least k, i.e., \(q_k=\sum _{j=k}^{M}p_j\), \(k=1,2,\ldots ,M\). The replenishment lead time is exponentially distributed with parameter \(\eta \).

It is assumed that customers are prevented from entering the system either when the on-hand inventory level is zero or when the server is off due to a vacation. Order size decisions and lead times are independent of the arrival process, the customer service time, and the server’s vacation.

Fig. 1
figure 1

Schematic diagram of the proposed queueing-inventory model

3 Steady-state analysis

In this section, we perform the steady-state analysis for the system model described in the previous section.

3.1 Stability condition

Let \(\{\varvec{S(t)},t\ge 0\}=\{(X(t),Y(t),Z(t)),t\ge 0\}\) be the state process of the system, where X(t) denotes the number of customers at time t, Y(t) denotes the inventory level at time t, and Z(t) denotes the status of the server at time t where Z(t) is defined to be either 0 or 1 according to whether the server is off due to a vacation or depleted inventory, or on and working. Then, the process \(\{\varvec{S(t)},t\ge 0\}\) is a QBD process with state space:

$$\begin{aligned} \varOmega = \cup _{n=0}^{\infty }\{n\} \end{aligned}$$

where

$$\begin{aligned} n=\{(n,0,0),(n,1,0),(n,1,1),\ldots ,(n,M,0),(n,M,1)\} \end{aligned}$$

is the collection of states with \(X(t)=n\), \(n\ge 0\), called the level n. The state-transition diagram of the QIS with server vacations is presented in Fig. 2.

Fig. 2
figure 2

State-transition diagram of the QIS with server vacations

The infinitesimal generator of the process \(\{\varvec{S(t)}, t\ge 0\}\) is as follows:

$$\begin{aligned} \varvec{Q}=\left( \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} \varvec{A}_{0} &{}\varvec{C} &{} &{} &{} \\ \varvec{B} &{}\varvec{A} &{}\varvec{C} &{} &{} \\ &{}\varvec{B} &{}\varvec{A} &{}\varvec{C} &{} \\ &{} &{} \ddots &{} \ddots &{} \ddots \end{array} \right) \end{aligned}$$

where \(\varvec{A}_0\), \(\varvec{B}\), \(\varvec{A}\) and \(\varvec{C}\) are all square matrices of the order \(2M+1\), and they are given as follows:

$$\begin{aligned} \varvec{A}_{0}= & {} \left( \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} -\eta &{}\eta p_1&{}0&{}\eta p_2&{}0&{}\cdots &{}\eta p_M&{}0 \\ 0&{}-\theta &{}\theta &{}0&{}0&{}\cdots &{}0&{}0 \\ 0&{}0&{}-\lambda &{}0&{}0&{}\cdots &{}0&{}0\\ 0&{}0&{}0&{}-\theta &{}\theta &{}\cdots &{}0&{}0 \\ 0&{}0&{}0&{}0&{}-\lambda &{}\cdots &{}0&{}0\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\vdots &{}&{}\vdots &{}\vdots \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}-\theta &{}\theta \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}-\lambda \end{array} \right) ,\\ \varvec{B}= & {} \left( \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}0&{}0\\ \mu &{}0&{}0&{}0&{}0&{}\cdots &{}0&{}0&{}0 \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}\mu &{}0&{}0&{}\cdots &{}0&{}0&{}0 \\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\vdots &{}&{}\vdots &{}\vdots &{}\vdots \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}\mu &{}0&{}0 \end{array} \right) ,\\ \varvec{A}= & {} \varvec{A}_{0}-\frac{\mu }{\lambda }\varvec{C} \end{aligned}$$

where,

$$\begin{aligned} \varvec{C}=\text{ diag }\{0,0,\lambda ,\ldots ,0,\lambda \} \end{aligned}$$

is a diagonal matrix.

Theorem 1

The process \(\{\varvec{S(t)},t\ge 0\} \) with the infinitesimal generator \(\varvec{Q}\) is positive recurrent if and only if \(\rho =\displaystyle {\frac{\lambda }{\mu }}<1\).

Proof

To derive the stability condition of the process \(\{\varvec{S(t)},t\ge 0\} \), we consider the matrix \(\varvec{H}=\varvec{A}+\varvec{B}+\varvec{C}\), which is given by

$$\begin{aligned} \varvec{H}=\left( \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} -\eta &{}\eta p_1&{}0&{}\eta p_2&{}0&{}\cdots &{}0&{}\eta p_M&{}0\\ 0&{}-\theta &{}\theta &{}0&{}0&{}\cdots &{}0&{}0&{}0\\ \mu &{}0&{}-\mu &{}0&{}0&{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}0&{}-\theta &{}\theta &{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}\mu &{}0&{}-\mu &{}\cdots &{}0&{}0&{}0\\ \vdots &{}\vdots &{} \vdots &{}\vdots &{}\vdots &{}&{}\vdots &{}\vdots &{}\vdots \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}-\theta &{}\theta \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}\mu &{}0&{}-\mu \\ \end{array} \right) . \end{aligned}$$

Let \(\varvec{\pi }=(\pi (0,0),\pi (1,0),\pi (1,1),\ldots ,\pi (M,0),\pi (M,1))\) be the steady-state probability vector of the generator \(\varvec{H}\). Then, \(\varvec{\pi }\) satisfies equations \(\varvec{\pi H}=\varvec{0}\) and \(\varvec{\pi e}=1\), where \(\varvec{e}\) is a column vector of 1’s of appropriate dimension. Solving these equations, we obtain

$$\begin{aligned} \pi (0,0)= & {} \frac{\mu }{\eta }K_h^{-1}, \end{aligned}$$
(1)
$$\begin{aligned} \pi (i,0)= & {} \frac{\mu }{\theta }p_i K_h^{-1},\ i=1,2,\ldots ,M, \end{aligned}$$
(2)
$$\begin{aligned} \pi (i,1)= & {} q_i K_h^{-1},\ i=1,2,\ldots ,M \end{aligned}$$
(3)

where

$$\begin{aligned} K_h=\frac{\mu }{\theta }+\frac{\mu }{\eta }+{\overline{p}}. \end{aligned}$$
(4)

From Neuts (1981), the process \(\{\varvec{S(t)},t\ge 0\} \) is positive recurrent if and only if

$$\begin{aligned} \varvec{\pi C e}<\varvec{\pi B e}, \end{aligned}$$

which is equivalent to

$$\begin{aligned} \lambda \sum _{i=1}^{M}\pi (i,1)<\mu \sum _{i=1}^{M}\pi (i,1). \end{aligned}$$
(5)

Using Eqs. (3) and (4), it is easy to verify that

$$\begin{aligned} \sum _{i=1}^{M}\pi (i,1)={\overline{p}}K_h^{-1}>0. \end{aligned}$$

Thus, Eq. (5) implies \(\displaystyle {\frac{\lambda }{\mu }}<1\). \(\square \)

Remark 1

Theorem 1 shows that the stability condition for the present model is the same as that of the M/M/1 classical queueing system, and this stability condition is independent from the parameters of the server’s vacation, the replenishment lead time, and the distribution of the random order size.

3.2 Stationary distribution

For computing the stationary distribution of the process \(\{\varvec{S(t)},t\ge 0\}\), we first consider a QIS with ROS policy and negligible service time. The other assumptions are the same as those given earlier. The corresponding Markov process for this case is defined as \(\{\varvec{{\hat{S}}(t)},t\ge 0\}=\{(Y(t),Z(t)),t\ge 0\}\), where Y(t) and Z(t) are defined as above. The state space of the process \(\{\varvec{{\hat{S}}(t)},t\ge 0\}\) is given as follows:

$$\begin{aligned} {\hat{\varOmega }}=\{(0,0),(1,0),(1,1),\ldots ,(M,0),(M,1)\}. \end{aligned}$$

The state-transition diagram of the QIS with negligible service time and server vacations is presented in Fig. 3.

Fig. 3
figure 3

State-transition diagram of the QIS with negligible service time and server vacations

This QIS’s infinitesimal generator \(\varvec{{\hat{Q}}}\) is given by

$$\begin{aligned} \varvec{{\hat{Q}}}=\left( \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} -\eta &{}\eta p_1&{}0&{}\eta p_2&{}0&{}\cdots &{}0&{}\eta p_M&{}0 \\ 0&{}-\theta &{}\theta &{}0&{}0&{}\cdots &{}0&{}0&{}0 \\ \lambda &{}0&{}-\lambda &{}0&{}0&{}\cdots &{}0&{}0&{}0\\ 0&{}0&{}0&{}-\theta &{}\theta &{}\cdots &{}0&{}0&{}0 \\ 0&{}0&{}\lambda &{}0&{}-\lambda &{}\cdots &{}0&{}0&{}0\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\vdots &{}&{}\vdots &{}\vdots &{}\vdots \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}0&{}-\theta &{}\theta \\ 0&{}0&{}0&{}0&{}0&{}\cdots &{}\lambda &{}0&{}-\lambda \end{array} \right) . \end{aligned}$$

Let \(\varvec{{\hat{\pi }}}=({\hat{\pi }}(0,0),{\hat{\pi }}(1,0),{\hat{\pi }}(1,1),\ldots ,{\hat{\pi }}(M,0),{\hat{\pi }}(M,1))\) be the steady-state probability vector of the generator \(\{\varvec{{\hat{S}}(t)},t\ge 0\}\). Then, \(\varvec{{\hat{\pi }}}\) satisfies the set of equations:

$$\begin{aligned} \left\{ \begin{array}{ccc} \varvec{{\hat{\pi }} {\hat{Q}}}&{}=&{}\varvec{0}\\ \varvec{{\hat{\pi }} e}&{}=&{}1. \end{array} \right. \end{aligned}$$
(6)

From matrix \(\varvec{H}\) and matrix \(\varvec{{\hat{Q}}}\), we observe that matrix \(\varvec{{\hat{Q}}}\) can be obtained if we change all \(\mu \) in matrix \(\varvec{H}\) by \(\lambda \). Thus, we can directly get the stationary probability distribution of the process \(\{\varvec{{\hat{S}}(t)},t\ge 0\}\) from Eqs. (1)-(4). Therefore, we have

$$\begin{aligned} {\hat{\pi }}(0,0)= & {} \frac{\lambda }{\eta }K_v^{-1}, \end{aligned}$$
(7)
$$\begin{aligned} {\hat{\pi }}(i,0)= & {} \frac{\lambda }{\theta }p_i K_v^{-1},\ i=1,2,\ldots ,M, \end{aligned}$$
(8)
$$\begin{aligned} {\hat{\pi }}(i,1)= & {} q_i K_v^{-1}, \ i=1,2,\ldots ,M \end{aligned}$$
(9)

where

$$\begin{aligned} K_v=\frac{\lambda }{\theta }+\frac{\lambda }{\eta }+{\overline{p}}. \end{aligned}$$
(10)

Using the steady-state probability vector \(\varvec{{\hat{\pi }}}\) given by Eqs. (7)-(10), we establish the stationary distribution of our system model described in Sect. 2. For this, let \(\varvec{x}=(\varvec{x}_0, \varvec{x}_1,\ldots ,\varvec{x}_n,\ldots )\) be the steady-state probability vector of the process \(\varvec{S(t)}\), where

$$\begin{aligned} \begin{array}{ccc} \varvec{x}_n= & {} (x(n,0,0), x(n,1,0), x(n,1,1),\ldots , x(n,M,0), x(n,M,1)),~n=0,1,\ldots . \end{array} \end{aligned}$$

Then, the steady-state probability vector \(\varvec{x}\) satisfies the set of equations:

$$\begin{aligned} \left\{ \begin{array}{ccc} x \varvec{Q}&{}=&{}\varvec{0} \\ x \varvec{e}&{}=&{}1. \end{array} \right. \end{aligned}$$
(11)

We can obtain the steady-state probability vector \(\varvec{x}\) by solving Eq. (11). The solution is given by the following theorem.

Theorem 2

If \(\rho <1\), the steady-state probability vector \(\varvec{x}\) of the process \(\{\varvec{S(t)},t\ge 0\}\) is given by

$$\begin{aligned} \varvec{x}=(\varvec{x}_{0},\varvec{x}_{1},\ldots ) \end{aligned}$$

where

$$\begin{aligned} \varvec{x}_{n}=\left( 1-\rho \right) \rho ^{n}\varvec{{\hat{\pi }}}, \ n\ge 0 \end{aligned}$$
(12)

and the components of the vector \(\varvec{{\hat{\pi }}}\) are given by Eqs. (7)-(10).

Proof

The first equation of the set of Eq. (11) can be rewritten as follows:

$$\begin{aligned}&\varvec{x}_0\varvec{A}_0 +\varvec{x}_1 \varvec{B}=\varvec{0}, \end{aligned}$$
(13)
$$\begin{aligned}&\quad \varvec{x}_{n} \varvec{C} +\varvec{x}_{n+1} \varvec{A}+\varvec{x}_{n+2}\varvec{B}=\varvec{0},\ n\ge 0. \end{aligned}$$
(14)

Let

$$\begin{aligned} \varvec{x}_{n}=\xi \rho ^n \varvec{{\hat{\pi }}}, \ n\ge 0 \end{aligned}$$
(15)

where \(\xi \) is a constant. We need to verify that Eqs. (13) and (14) are satisfied by Eq. (15). Substituting Eq. (15) into the left side of Eq. (13), we have

$$\begin{aligned} \varvec{x}_0\varvec{A}_0+\varvec{x}_1\varvec{B}=\xi \varvec{{\hat{\pi }}}\left( \varvec{A}_0+\rho \varvec{B}\right) . \end{aligned}$$

Substituting Eq. (15) into the left side of Eq. (14), we have

$$\begin{aligned} \varvec{x}_{n}\varvec{C} +\varvec{x}_{n+1} \varvec{A}+\varvec{x}_{n+2} \varvec{B}= & {} \xi \rho ^n \varvec{{\hat{\pi }}}\left[ \varvec{C}+\rho \varvec{A}+ \rho ^2 \varvec{B}\right] \nonumber \\= & {} \xi \rho ^n\varvec{{\hat{\pi }}}\left[ \varvec{C}+\rho \left( \varvec{A}_0-\frac{1}{\rho }\varvec{C}\right) +\rho ^2 \varvec{B}\right] \nonumber \\= & {} \xi \rho ^{n+1}\varvec{{\hat{\pi }}}\left( \varvec{A}_0+\rho \varvec{B}\right) ,\ n\ge 0. \end{aligned}$$

From the structure of the matrices \(\varvec{A}_0\), \(\varvec{B}\) and \(\varvec{{\hat{Q}}}\), it is easy to verify that \(\varvec{A}_0+\rho \varvec{B}=\varvec{{\hat{Q}}}\). Then, we have

$$\begin{aligned} \varvec{{\hat{\pi }}}\left( \varvec{A}_0+\rho \varvec{B}\right) =\varvec{{\hat{\pi }}}\varvec{{\hat{Q}}}=\varvec{0}. \end{aligned}$$

Thus, Eqs. (13) and (14) are satisfied by Eq. (15). Applying the normalizing condition \(\textit{\textbf{x e}}=1\) and noting that \(\varvec{{\hat{\pi }} e}=1\), we get \(\xi =1-\rho \).\(\square \)

Remark 2

Theorem 2 shows that the stationary distribution of the system has a product form of two marginal distributions: One is the stationary distribution of the queue length in the M/M/1 traditional queueing system with the same parameters \(\lambda \) and \(\mu \), and the other one is the stationary distribution of the on-hand inventory level of the QIS system with server’s multiple vacations and ROS policy when the service time is negligible.

3.3 Conditional distributions of the on-hand inventory level

In this subsection, we first compute the marginal stationary distributions of the queue length, the on-hand inventory level and the status of the server, respectively. Then, we investigate the conditional distributions of the mean on-hand inventory level when the server is off due to a vacation or depleted inventory, and when it is on and working.

Theorem 3

(a) The marginal stationary distribution of the queue length \(\{X(t),t\ge 0\}\) is equal to the stationary distribution of the queue length in the classical M/M/1-FCFS system with the same parameter \(\lambda \) and \(\mu \).

(b) The marginal stationary distribution of the on-hand inventory level \(\{Y(t),\) \(t\ge 0\}\) is given by

$$\begin{aligned} P(Y=k)=\left\{ \begin{array}{ll} \displaystyle {\frac{\lambda }{\eta }}K_v^{-1},\ k=0\\ \left( \displaystyle {\frac{\lambda }{\theta }p_k+q_k} \right) K_v^{-1},\ k=1,2,\ldots ,M. \end{array} \right. \end{aligned}$$
(16)

The mean on-hand inventory level is given by

$$\begin{aligned} {\overline{I}}=\left( \frac{\lambda }{\theta }{\overline{p}}+\sum _{i=1}^{M}i q_i\right) K_v^{-1}. \end{aligned}$$
(17)

(c) The marginal stationary distribution of the status of the server \(\{Z(t),t\ge 0\}\) is given by

$$\begin{aligned} P(Z=k)=\left\{ \begin{array}{ll} \left( \displaystyle {\frac{\lambda }{\theta }+\frac{\lambda }{\eta }}\right) K_v^{-1},\ k=0 \\ \quad {\overline{p}}K_v^{-1},\ k=1. \end{array} \right. \end{aligned}$$
(18)

Proof

The results are directly obtained using Theorem 2. The detail for the proof is omitted.\(\square \)

Theorem 4

(a) The conditional distributions of the on-hand inventory level when the server is off due to a vacation or depleted inventory, and when it is on and working are given by

$$\begin{aligned} P(Y=k|Z=0)=\left\{ \begin{array}{l@{\quad }l} \displaystyle {\frac{\theta }{\eta +\theta }},&{} k=0\\ \displaystyle {\frac{\eta }{\eta +\theta }}p_{k},&{} k=1,2,\ldots ,M \end{array} \right. \end{aligned}$$
(19)

and

$$\begin{aligned} P(Y=k|Z=1)=\frac{q_k}{{\overline{p}}},\ k=1,2,\ldots ,M. \end{aligned}$$
(20)

(b) The conditional mean on-hand inventory levels when the server is off due to a vacation or depleted inventory, and when it is on and working are given by

$$\begin{aligned} E(Y|Z=0)=\frac{\eta {\overline{p}}}{\eta +\theta } \end{aligned}$$
(21)

and

$$\begin{aligned} E(Y|Z=1)=\frac{1}{{\overline{p}}}\sum _{k=1}^{M}kq_k. \end{aligned}$$
(22)

Proof

The detail for the proof is omitted since it is as simple as that of Theorem 3.\(\square \)

For Eq. (17), let \(\theta \rightarrow \infty \), we obtain the mean oh-hand inventory level denoted by \({\overline{I}}^s\) as follows:

$$\begin{aligned} {\overline{I}}^s=\sum _{i=1}^{M}i q_i K_{Y}^{-1} \end{aligned}$$
(23)

where

$$\begin{aligned} K_{Y}=\frac{\lambda }{\eta }+{\overline{p}}. \end{aligned}$$

This agrees with the corresponding result for the QIS model with ROS policy that was given by Schwarz et al. (2006) (see p. 60, Eq. (5)).

Remark 3

(a) From Eqs. (19) and (21), it is observed that the conditional distribution of the on-hand inventory level when the server is off due to a vacation or depleted inventory and its expectation \(E(Y|Z=0)\) is independent from the arrival rate \(\lambda \), and that they are not dependent on parameters \(\eta \) and \(\theta \) individually but only on their proportions \(\eta /\theta \). (b) From Eqs. (20) and (22), it is observed that the conditional distribution of the on-hand inventory level when the server is on and working and its expectation \(E(Y|Z=1)\) is completely independent from parameters \(\lambda \), \(\eta \) and \(\theta \), and that they are only dependent on the distribution of \(F_p\). (c) There is also independence of \(\mu \) as well throughout for all the performance measures mentioned above.

Remark 4

(a) Equation (21) shows that the conditional mean on-hand inventory level when the server is off due to a vacation or depleted inventory \(E(Y|Z=0)\) is less than the mean order size \({\overline{p}}\). (b) Using Eq. (23), for Eq. (22), we have

$$\begin{aligned} E(Y|Z=1)=\left( 1+\frac{\lambda }{\eta {\overline{p}}}\right) {\overline{I}}^s>{\overline{I}}^s, \end{aligned}$$

i.e., the conditional mean on-hand inventory level when the server is on and working is larger than the mean on-hand inventory \({\overline{I}}^s\) for the QIS model with ROS policy presented in Schwarz et al. (2006).

4 Performance measures and monotonicity

In this section, we derive other performance measures in addition to the mean on-hand inventory level and the conditional mean on-hand inventory levels that have been obtained earlier. Then, we compare the performance measures for this model to those for the QIS model with ROS policy presented in Schwarz et al. (2006). Finally, in order to understand the effect of the vacation rate on the performance measures, we consider the monotonicity of these performance measures in \(\theta \).

4.1 Performance measures

In this subsection, we compute some performance measures using the stationary distribution given in Sect. 3.2.

(a) The expected number of inventory replenished per unit of time (reorder rate) is given by

$$\begin{aligned} \lambda _R=\sum _{k=1}^{M}\eta p_k P(Y=0)= \lambda K_v^{-1}. \end{aligned}$$
(24)

(b) The average number of lost sales incurred per unit of time is given by

$$\begin{aligned} {\overline{LS}}=\lambda P(Z=0)=\left( \frac{\lambda ^2}{\eta }+\frac{\lambda ^2}{\theta }\right) K_v^{-1}. \end{aligned}$$
(25)

(c) A cycle is defined as the time between the placing of two successive orders, see Schwarz et al. (2006) (p. 60). So, the mean cycle time is \(\lambda _{R}^{-1}\). Thus, the mean number of lost sales per cycle is given by

$$\begin{aligned} {\overline{LS}}_c=\frac{{\overline{LS}}}{\lambda _R}=\frac{\lambda }{\eta }+\frac{\lambda }{\theta }. \end{aligned}$$
(26)

(d) According to Schwarz et al. (2006) (p. 61), \(\beta \)-service level is defined by

$$\begin{aligned} \beta =\frac{\text{ E(satisfied } \text{ demand } \text{ per } \text{ unit } \text{ of } \text{ time) }}{\text{ E(total } \text{ demand } \text{ per } \text{ unit } \text{ of } \text{ time) }}. \end{aligned}$$

Thus, the \(\beta \)-service level is given by

$$\begin{aligned} \beta =\frac{\lambda -{\overline{LS}}}{\lambda } =1-\left( \frac{\lambda }{\eta }+\frac{\lambda }{\theta }\right) K_v^{-1}. \end{aligned}$$
(27)

(e) The mean arrival rate of customers who are admitted to the system per unit of time is given by

$$\begin{aligned} \lambda _A=\lambda -{\overline{LS}}= \lambda \beta . \end{aligned}$$
(28)

(f) Let \({\overline{L}}_0\) and \({\overline{L}}_1\) denote the mean number of customers in the system and the mean number of customers in the queue, respectively. Then, we have

$$\begin{aligned} {\overline{L}}_0=\frac{\lambda }{\mu -\lambda } \end{aligned}$$
(29)

and

$$\begin{aligned} {\overline{L}}_1= & {} \sum _{n=0}^{\infty }\sum _{i=0}^{M}n x(n,i,0)+\sum _{n=1}^{\infty }\sum _{i=1}^{M}(n-1) x(n,i,1)\nonumber \\= & {} \frac{\lambda }{\mu -\lambda }-\frac{\lambda }{\mu }{\overline{p}} K_v^{-1}. \end{aligned}$$
(30)

(g) From Little’s formula, the customer’s mean sojourn time \({\overline{W}}_0\) and the mean waiting time \({\overline{W}}_1\) are given by

$$\begin{aligned} {\overline{W}}_0=\frac{{\overline{L}}_0}{\lambda _A}=\frac{K_v}{(\mu -\lambda ){\overline{p}}} \end{aligned}$$
(31)

and

$$\begin{aligned} {\overline{W}}_1=\frac{{\overline{L}}_1}{\lambda _A}=\frac{ K_v}{(\mu -\lambda ){\overline{p}}}-\frac{1}{\mu }. \end{aligned}$$
(32)

Remark 5

(a) From the above expressions of the performance measures, we observe that some performance measures like \({\overline{I}}\), \({\overline{LS}}_c\) and \(\beta \) are not dependent on parameters \(\lambda \), \(\eta \) and \(\theta \) individually but only on their proportions \(\lambda /\eta \) and \(\lambda /\theta \). (b) Concerning the influence of \(F_p\), we observe that all the performance measures derived above, other than \({\overline{I}}\) and \(E(Y|Z=1)\), are only dependent on the first moment \({\overline{p}}\) of \(F_p\), or completely independent of \(F_p\) like \({\overline{LS}}_c\) and \({\overline{L}}_0\). (c) \(\mu \) is also independent throughout for some performance measures related to inventory including \({\overline{I}}\), \(\lambda _R\), \({\overline{LS}}\), \(\beta \) and \(\lambda _A\). This is because that the stationary distribution of the system has a product form of two marginal distributions (see Theorem 2).

4.2 Comparison with Schwarz et al. (2006)

If we let \(\theta \rightarrow \infty \) in all the performance measures expressed above, we can obtain the corresponding performance measures of the QIS with ROS policy which have been obtained by Schwarz et al. (2006). We use superscript ‘s’ to denote the corresponding performance measures, e.g., \(\overline{I^s}\), \(\lambda _{R}^{s}\), \({\overline{LS}}^{s}\), \({\overline{LS}}_{c}^{s}\), \(\beta ^s\), \(\lambda _{A}^{s}\), \({\overline{W}}_{0}^{s}\) and \({\overline{W}}_{1}^{s}\), for the QIS model with ROS policy that was studied by Schwarz et al. (2006).

For the mean on-hand inventory level \({\overline{I}}\), from Eqs. (17) and (23), we have the following decomposition:

$$\begin{aligned} {\overline{I}}=\alpha {\overline{I}}^s+(1-\alpha ){\overline{p}} \end{aligned}$$
(33)

where \(\alpha \) is a positive constant and is given by

$$\begin{aligned} \alpha =\frac{\displaystyle {\frac{\lambda }{\eta }}+{\overline{p}}}{\displaystyle {\frac{\lambda }{\theta }+\frac{\lambda }{\eta }}+{\overline{p}}} \end{aligned}$$
(34)

and \({\overline{I}}^s\) is given by Eq. (23).

Remark 6

This decomposition shows that the mean on-hand inventory level \({\overline{I}}\) is the weighted average sum of the mean on-hand inventory level \({\overline{I}}^s\) of the QIS model with ROS policy presented in Schwarz et al. (2006) and the mean order size \({\overline{p}}\). It is also easy to see that the weight number \(\alpha \) increases with \(\theta \), and that \(\alpha \) approaches to one when \(\theta \rightarrow \infty \).

Table 1 Relationships of the performance measures to our model and the corresponding model in Schwarz et al. (2006)

Similarly, we can derive other relationships that exists between the performance measures for our model and the corresponding performance measures for the model presented in Schwarz et al. (2006). All these relationships are summarized in Table 1, where \(\varDelta _1\) and \(\varDelta _2\) are given by

$$\begin{aligned} \varDelta _1=\frac{\lambda }{\theta {\overline{p}}(\mu -\lambda )} \end{aligned}$$
(35)

and

$$\begin{aligned} \varDelta _2=\frac{\lambda }{\theta {\overline{p}}(\mu -\lambda )}+\frac{\lambda }{\mu \eta {\overline{p}}}. \end{aligned}$$
(36)

4.3 Monotonicity

In the following, we consider the monotonicity of the performance measures on the vacation rate \(\theta \) by referring to the relationships given in Table 1.

Using the relationships for \({\overline{I}}\) given in Table 1, we have

$$\begin{aligned} \frac{\text{ d }{\overline{I}}}{\text{ d }\theta }=\frac{\text{ d }\alpha }{\text{ d }\theta }({\overline{I}}^s-{\overline{p}}). \end{aligned}$$

We note that \(\frac{\text{ d }\alpha }{\text{ d }\theta }<0\). Hence, we find the following conditions for the monotonicity of \({\overline{I}}\) on \(\theta \): (a) If \({\overline{I}}^s<{\overline{p}}\) then \({\overline{I}}\) increases with \(\theta \). (b) If \({\overline{I}}^s>{\overline{p}}\) then \({\overline{I}}\) decreases with \(\theta \). (c) If \({\overline{I}}^s={\overline{p}}\) then the vacation rate \(\theta \) does not influence \({\overline{I}}\).

Noting that \(\frac{\text{ d }\alpha }{\text{ d }\theta }<0\), it is easy to see from Table 1 that some performance measures like \(\lambda _R\), \({\overline{LS}}\), \({\overline{LS}}_c\), \({\overline{W}}_{0}\) and \({\overline{W}}_{1}\) decrease with \(\theta \).

Using the relationships for \(\beta \) and \(\lambda _A\) given in Table 1, we have

$$\begin{aligned} \frac{\text{ d }\beta }{\text{ d }\theta }=\frac{\text{ d }\alpha }{\text{ d }\theta }(\beta ^s-1)>0 \end{aligned}$$

and

$$\begin{aligned} \frac{\text{ d }\lambda _A}{\text{ d }\theta }=\frac{\text{ d }\alpha }{\text{ d }\theta }(\lambda _{A}^{s}-\lambda )>0. \end{aligned}$$

Hence, \(\beta \) and \(\lambda _A\) increase with \(\theta \).

5 Numerical examples

In this section, we investigate three examples for the distribution of the random order size which have the same mean order size.

  1. (i)

    Deterministic distribution (DET). Let us assume that the order size is fixed and equal to deterministic number \(d\in E=\{1,2,\ldots ,M\}\). Hence, we have \(p_d=1\), and \(p_k=0\) for other \(k\in E\) and \(k\ne d\). The mean order size \({\overline{p}}=d\). This is the (0, d) inventory policy.

  2. (ii)

    Uniform distribution (UNI). Let the order size be equally distributed in set E. Hence, we have \(p_k=1/M\) for all \(k\in E\). We fix \(M=2d-1\), so that the mean order size \({\overline{p}}=d\).

  3. (iii)

    Modified binomial distribution (MBI). Let us assume that the order size follows the modified binomial distribution in set E with the following probability distribution:

    $$\begin{aligned} p_k=\left\{ \begin{array}{l@{\quad }l} q^M+Mpq^{M-1}, &{} k=1 \\ C_{M}^{k}p^k q^{M-k}, &{} k=2,3,\ldots ,M \end{array}\right. \end{aligned}$$

    where \(p>0, p+q=1\). It is easy to see the mean order size \({\overline{p}}=Mp+q^M\). We select an integer M such that it approximately satisfies the equality \(Mp+q^M=d\), so that the mean order size will be approximately equal to d.

Following this, we examine the effect of the above three distributions of the random order size on the mean on-hand inventory level \({\overline{I}}\). We plot the curves for \({\overline{I}}\) by varying the order size distributions and the parameters \(\lambda \), \(\eta \) and \(\theta \), respectively. We set \(d=6\). For the deterministic distribution, we fix \(M=6\). For the uniform distribution, we fix \(M=11\). For the modified binomial distribution, we fix \(M=15\) and \(p=0.4\). Thus, the mean order sizes for each of the three distributions are equal to 6, or are approximately equal to 6. Figure 4 corresponds to the case of the varying parameter \(\lambda \) and the fixed parameters \(\eta =3\) and \(\theta =5\). Figure 5 corresponds to the case of the varying parameter \(\eta \) and the fixed parameters \(\lambda =10\) and \(\theta =5\). Figure 6 corresponds to the case of the varying parameter \(\theta \) and the fixed parameters \(\lambda =10\) and \(\eta =3\).

Fig. 4
figure 4

Effect of parameter \(\lambda \) on the mean on-hand inventory level \({\overline{I}}\)

Fig. 5
figure 5

Effect of parameter \(\eta \) on the mean on-hand inventory level \({\overline{I}}\)

Fig. 6
figure 6

Effect of parameter \(\theta \) on the mean on-hand inventory level \({\overline{I}}\)

Figure 4 shows that the mean on-hand inventory level \({\overline{I}}\) decreases with parameter \(\lambda \) for each of the three order size distributions. It is observed that the difference of \({\overline{I}}\) under the three distributions deceases with an increase in parameter \(\lambda \). It is observed from Fig. 5 that the mean on-hand inventory level \({\overline{I}}\) increases with parameter \(\eta \) for each of the three distributions, and the difference of \({\overline{I}}\) under the three distributions increases with an increase in parameter \(\eta \). From Fig. 6, we observe that the mean on-hand inventory level \({\overline{I}}\) decreases with parameter \(\theta \) for each of the three distributions, and the difference of \({\overline{I}}\) under the three distributions increases with an increase in parameter \(\theta \).

It is observed from Figs. 4, 5 and 6 that the mean on-hand inventory level \({\overline{I}}\) is minimal for a deterministic distribution, and is maximal for a uniform distribution.

6 Simulation study

From the performance measures obtained in Sects. 3 and 4, we found some invariance properties which can be summarized as follows: (i) some performance measures related to inventory management (including \({\overline{I}}\), \(E(Y|Z=0)\), \(E(Y|Z=1)\); \(\lambda _R\), \({\overline{LS}}\), \({\overline{LS}}_{C}\), \(\beta \) and \(\lambda _A\)) are not dependent on the service rate \(\mu \) (see Remarks 3 and 5); (ii) the mean number of customers in the system \({\overline{L}}_0\) and the conditional mean on-hand inventory level \(E(Y|Z=1)\) are not dependent on the parameters \(\eta \) and \(\theta \); (iii) the conditional mean on-hand inventory levels \(E(Y|Z=0)\) and \(E(Y|Z=1)\) are not dependent on the arrival rate \(\lambda \). These properties have been analytically proven for the case of M/M/1 QIS model described in Sect. 2. However, if the inter-arrival times and the service times are not exponentially distributed and the other assumptions are the same as that in our model described in Sect. 2, can we have these invariance properties?

Since it is not easy to obtain the above performance measures in closed form for the cases of non-exponential distributions of the inter-arrival times and the service times, the simulation method will be used to obtain the above performance measures. Therefore, in this section, we perform simulation experiments with various distribution settings of the inter-arrival times and the service times and examine the effect of the variance of the distributions on some of the system performance measures.

Firstly, we perform a set of experiments to test the accuracy of the simulation. For this purpose, we perform the simulations for the M/M/1 QIS model in Sect. 2 and compare the simulation results with the analytical results for the mean on-hand inventory level \({\overline{I}}\) obtained in Sect. 3. The relative difference for the performance measures \({\overline{I}}\) is computed by

$$\begin{aligned} \epsilon =100\frac{\left| {\overline{I}}_{sim}-{\overline{I}}_{exa}\right| }{{\overline{I}}_{sim}} \end{aligned}$$

where \({\overline{I}}_{exa}\) and \({\overline{I}}_{sim}\) represent the exact result and the simulation result, respectively.

In this set of experiments, we fix the arrival rate \(\lambda =10\) and the service rate \(\mu =15\). Each of the simulation experiments is characterized by the following factors: (i) the distribution of the random order size D; (ii) the lead time parameter \(\eta \), and (iii) the vacation time parameter \(\theta \). We consider the three different distributions of the random order size which are described in Sect. 5. The parameters \(\eta \) and \(\theta \) are varied over 5 levels: 1, 2, 3, 4, 5. The simulation experiments include a total of \(3\times 5\times 5=75\) scenarios. In our simulation study, we make use of the simulation language Python. We stimulate these scenarios 50,000 unit times. The relative differences between the exact results and the outcomes of the simulation are given in Table 2.

Table 2 Relative differences between the exact results and the outcomes of the simulations

From the summary statistics presented in Table 2, we see that the average errors in estimating \({\overline{I}}\) for the deterministic distribution, the uniform distribution and the modified binomial distribution are 3.10%, 4.15% and 3.42%, respectively. The maximum error in our set of 75 instances is 11.95%, and the minimal error is 0.35%. For the average error of simulating \({\overline{I}}\), the deterministic distribution is minimal among the three distributions of the random order size D. Thus, in our following sets of experiments, we fix the order size distribution to be a deterministic distribution with fixed order size \(D=6\).

Now, we perform the following sets of experiments to see if we still have the invariance properties mentioned above when the inter-arrival times and the service times are not exponentially distributed. For this purpose, in the design of simulation study, we consider the following three different probability distributions for the inter-arrival times:

  1. (i)

    Exponential distribution (EXA). The probability density function is

    $$\begin{aligned} f_{1}(x)=\lambda e^{-\lambda x},\ x>0. \end{aligned}$$
  2. (ii)

    Erlang distribution (ERA). The probability density function is

    $$\begin{aligned} f_{2}(x)=\frac{\lambda (\lambda x)^{k-1}}{(k-1)!}e^{-\lambda x},\ x>0. \end{aligned}$$
  3. (iii)

    Hyper-exponential distribution (HEA). The probability density function is

    $$\begin{aligned} f_{3}(x)=\sum _{i=1}^{n}p_i\lambda _{i} e^{-\lambda _{i} x},\ x>0. \end{aligned}$$

The parameters of the inter-arrival times are normalized so as to obtain the same arrival rate which is denoted by \(\lambda _{ar}\). We also use the following four different probability distributions for the service times:

  1. (i)

    Exponential distribution (EXS). The probability density function is

    $$\begin{aligned} g_{1}(x)=\mu e^{-\mu x},\ x>0. \end{aligned}$$
  2. (ii)

    Erlang distribution (ERS). The probability density function is

    $$\begin{aligned} g_{2}(x)=\frac{\mu (\mu x)^{k-1}}{(k-1)!}e^{-\mu x},\ x>0. \end{aligned}$$
  3. (iii)

    Hyper-exponential distribution (HES). The probability density function is

    $$\begin{aligned} g_{3}(x)=\sum _{i=1}^{n}p_i\mu _{i} e^{-\mu _{i} x},\ x>0. \end{aligned}$$
  4. (iv)

    Log-normal distribution (LNS). The probability density function is

    $$\begin{aligned} g_{4}(x)=\frac{1}{\sqrt{2\pi }\sigma x}e^{-\frac{(ln x-\mu )^{2}}{2\sigma ^2}},\ x>0. \end{aligned}$$

The parameters of the service time are normalized so as to obtain the same service rate which is denoted by \(\mu _{sr}\).

In the second set of experiments, we study the effect of the service rate \(\mu _{sr}\) on some of the performance measures. We mainly look at the following performance measures: \({\overline{I}}\), \(E(Y|Z=0)\), \(E(Y|Z=1)\), \({\overline{LS}}\) and \(\lambda _A\). We consider the three inter-arrival time distributions and the four service time distributions defined above. The service rate is varied over four levels: \(\mu _{sr}=15,17,19,21\). The parameters \(\eta \) and \(\theta \) are fixed as: \(\eta =4\), \(\theta =2\). Thus, the simulation experiments include a total of \(5\times 3\times 4\times 4=240\) (5 performance measures \(\times \) 3 inter-arrival time distributions \(\times \) 4 service time distributions \(\times \) 4 levels of service rates) scenarios. The simulation results for \({\overline{I}}\), \(E(Y|Z=0)\), \(E(Y|Z=1)\), \(\lambda _R\) and \({\overline{LS}}\) are displayed in Tables 3, 4, 5, 6 and 7, respectively.

Table 3 The effect of the service rate \(\mu _{sr}\) on \({\overline{I}}\) under various scenarios
Table 4 The effect of the service rate \(\mu _{sr}\) on \(E(Y|Z=0)\) under various scenarios
Table 5 The effect of the service rate \(\mu _{sr}\) on \(E(Y|Z=1)\) under various scenarios
Table 6 The effect of the service rate \(\mu _{sr}\) on \(\lambda _R\) under various scenarios
Table 7 The effect of the service rate \(\mu _{sr}\) on \({\overline{LS}}\) under various scenarios

From these tables, we immediately conclude the following observations:

  1. (i)

    If the service rate \(\mu _{sr}\) is fixed to any one of the four levels and the service time distribution is fixed to any one of the four distributions: EXS, ERS, HES and LNS, then the variance of the different inter-arrival time distributions barely affects the performance measures \({\overline{I}}\) and \({\overline{LS}}\), and it especially does not affect \(\lambda _{R}\).

  2. (ii)

    If the service rate \(\mu _{sr}\) is fixed to any one of the four levels and the inter-arrival distribution is fixed to any one of the three distributions: EXA, ERA and HEA, then the variance of the different service time distributions barely affects the performance measures \({\overline{I}}\) and \({\overline{LS}}\), and it especially does not affect \(\lambda _{R}\).

  3. (iii)

    If the inter-arrival time distribution is fixed to any one of the three distributions: EXA, ERA and HEA, and the service time distribution is fixed to any one of the four distributions: EXS, ERS, HES and LNS, then the variance of the different service rates barely affects the performance measures \({\overline{I}}\) and \({\overline{LS}}\), and it especially does not affect \(\lambda _{R}\).

Since the other performances \({\overline{LS}}_{C}\), \(\beta \) and \(\lambda _A\) can be derived by means of \({\overline{LS}}\) and \(\lambda _A\) (see Eqs. (27)-(29)), we conclude from these observations that if the inter-arrival times and the service times are not exponentially distributed and the other assumptions are the same as that in our model described in Sect. 2, the performance measures related to inventory management mentioned above are not dependent on the service rate \(\mu _{sr}\).

In the third set of experiments, we study the effect of the parameters \(\eta \) and \(\theta \) on the mean number of customers in the system \({\overline{L}}_0\) and the conditional mean on-hand inventory level \(E(Y|Z=1)\). We consider the three inter-arrival time distributions with the common arrival rate \(\lambda _{ar}=10\) and the four service time distributions with the common service rate \(\mu _{sr}=15\) defined above. The parameters \(\eta \) and \(\theta \) are varied over two levels: \(\eta =4,14\), \(\theta =2,12\). Thus, the simulation experiments include a total of \(2\times 3\times 4\times 2\times 2=96\) (2 performance measures \(\times \) 3 inter-arrival time distributions \(\times \) 4 service time distributions \(\times \) 2 levels of \(\eta \) \(\times \) 2 levels of \(\theta \)) scenarios. The simulation results for \({\overline{L}}_0\) and \(E(Y|Z=1)\) are displayed in Tables 8 and 9, respectively.

Table 8 The effect of the parameters \(\eta \) and \(\theta \) on \({\overline{L}}_0\) under various scenarios
Table 9 The effect of the parameter \(\eta \) and \(\theta \) on \(E(Y|Z=1)\) under various scenarios

From Tables 8 and 9, we observe that there is no significant dependence of the parameter \(\eta \) and \(\theta \) on the performance measures \({\overline{L}}_0\) and \(E(Y|Z=0)\) under various scenarios.

In the last set of experiments, we study the effect of the arrival rate \(\lambda _{ar}\) on the conditional mean on-hand inventory levels \(E(Y|Z=0)\) and \(E(Y|Z=1)\). We consider the three inter-arrival time distributions and the four service time distributions with the common service rate \(\mu _{sr}=15\) defined above. The arrival rate \(\lambda _{ar}\) is varied over 3 levels: \(\lambda _{ar}=6,8,10\). The parameters \(\eta \) and \(\theta \) are fixed as: \(\eta =4\), \(\theta =2\). Thus, the simulation experiments include a total of \(2\times 3\times 4\times 3=96\) (2 performance measures \(\times \) 3 inter-arrival time distributions \(\times \) 4 service time distributions \(\times \) 3 levels of the arrival rate \(\lambda _{ar}\)) scenarios. The simulation results for \(E(Y|Z=0)\) and \(E(Y|Z=1)\) are displayed in Tables 10 and 11, respectively.

Table 10 The effect of the arrival rate \(\lambda _{ar}\) on \(E(Y|Z=0)\) under various scenarios
Table 11 The effect of the arrival rate \(\lambda _{ar}\) on \(E(Y|Z=1)\) under various scenarios

From Tables 10 and 11, it is observed that there is no significant dependence of the arrival rate \(\lambda _{ar}\) on the performance measures \(E(Y|Z=0)\) and \(E(Y|Z=1)\) under various scenarios.

From all the observations above, we get an answer for the question proposed at the beginning of this section, i.e., if the inter-arrival times and the service times are not exponentially distributed and the other assumptions are the same as that in our model described in Sect. 2, we still have the invariance properties mentioned above.

7 Managerial suggestions

From the performance measures obtained in Sects. 3 and 4, we have found that all the performance measures except the mean on-hand inventory level \({\overline{I}}\) and the conditional mean on-hand inventory level \(E(Y|Z=1)\) are only dependent on the mean order size \({\overline{p}}\) of the random order size D, or completely independent of the distribution \(F_p\) of D like the mean number of lost sales per cycle \({\overline{LS}}_c\) and the mean number of customers in the system \({\overline{L}}_0\) (see Remark 5). The analysis of numerical examples in Sect. 6 show that the mean on-hand inventory level \({\overline{I}}\) is minimal for the deterministic order size distribution. Therefore, we recommend to managers in queueing-inventory systems that they pay more attention on the mean order size than the distribution of the random order size, and that the deterministic order size might be an optimal replenishment policy from the point of view of the mean on-hand inventory level.

In practice, it is common in service systems to allow the server to have a vacation when the server is idle. From economic point of view, allowing a server to take a vacation can reduce the expenses incurred when the server is idle. Also, where the server is a human being, continuous work creates physical stress and mental pressure that reduce the server’s working efficiency. As pointed out by Jeganathana and Abdul (2020), “A vacation period helps persons avoid stress factors and restore their energy and confidence to work efficiently”. However, from the comparison of our model with the QIS model with no server’s vacation and monotonicity of the performance measures on the vacation rate (see Sects. 4.2 and 4.3), we found that server’s vacation in QIS has a significant effect on inventory management and the satisfaction of the customers. Therefore, we recommend that managers in QIS must consider the effect of a server’s vacation on the inventory management and the quality of service. Neglecting a server’s vacation in QIS will lead to poorer outcomes in inventory decision making.

From the analytical and simulation study, we have found that all the performance measures except the mean number of customers in the system \({\overline{L}}_0\), the mean number of customers in the queue \({\overline{L}}_1\), the customer’s mean sojourn time \({\overline{W}}_0\) and the mean waiting time \({\overline{W}}_1\) are not dependent on the service rate. Therefore, we recommend that a company should not blindly improve the service capacity since the improvement of the service capacity does not guarantee a decrease in the rate of customer losses. However, the improvement of the service capacity will decrease the waiting time of customers and thus increase customers’ satisfaction. This will be helpful for improving the company’s reputation. However, it will increase the service operating costs. Therefore, managers should consider the inventory management and the service process integrally.

8 Conclusion

In this paper, we studied the queueing-inventory system with random order size policy and lost sales, where a multiple vacation policy for the server was considered when the on-hand inventory was depleted. It was found that the stability condition was independent of the vacation rate, the parameter of lead time, and the distribution of the random order size. We obtained the stationary distribution of the system as a product of the marginal distributions. We observed that the conditional distribution of the on-hand inventory level when the server is off due to a vacation or depleted inventory and its expectation \(E(Y|Z=0)\) are independent of the arrival rate \(\lambda \). We also observed that the conditional distribution of the on-hand inventory level when the server is on and working and its expectation \(E(Y|Z=1)\) are completely independent with parameters \(\lambda \), \(\eta \) and \(\theta \). Some monotonicity for the performance measures on the vacation rate was obtained. Numerical examples show that the mean on-hand inventory level for the deterministic distribution of the order size was the minimal among the three distributions of the order size. The simulation study shows that some invariance properties still hold if the inter-arrival times and the service times are not exponentially distributed and the other assumptions are the same as that in our model. Our model can be further extended to a more general case with Phase-type distributions of service times, lead times and vacation times. However, the computational complexity increases significantly with the state space size.