The MX/M/c\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^{X}/M/c$$\end{document} Bernoulli feedback queue with variant multiple working vacations and impatient customers: performance and economic analysis

The present paper deals with an MX/M/c\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^{X}/M/c$$\end{document} Bernoulli feedback queueing system with variant multiple working vacations and impatience timers which depend on the states of the servers. Whenever a customer arrives at the system, he activates an random impatience timer. If his service has not been completed before his impatience timer expires, the customer may abandon the system. Using certain customer retention mechanism, the impatient customer can be retained in the system. After getting incomplete or unsatisfactory service, with some probability, each customer may comeback to the system as a Bernoulli feedback. Using the probability generating functions (PGFs), we derive the steady-state solution of the model. Then, we obtain useful performance measures. Moreover, we carry out an economic analysis. Finally, numerical study is performed to explore the effects of the model parameters on the behavior of the system.

schedule working vacations and vacation interruption. Laxmi and Jyothsna [10] dealt with balking and reneging multiple working vacations queue with heterogeneous servers. Later, Tian et al. [19] presented equilibrium and optimal strategies in M/M/1 queueing model with working vacations and vacation interruptions. Recently, in Bouchentouf and Yahiaoui [2], a study on queueing system with Bernoulli feedback, reneging and retention of reneged customers, multiple working vacations, and Bernoulli schedule vacation interruption has been done. For more literature on customer impatience in working vacation queueing models, the authors may be referred to Selvaraju and Goswami [15] and Laxmi and Jyothsna [8,9].
Variant of multiple vacation policy is relatively a recent one where it is permitted to the server to take a certain fixed number of consecutive vacations, if the system remains empty at the end of a vacation. This sort of vacation schedule was carried out by Zhang and Tian [24]. In their paper, a Geo/G/1 queueing model with multiple adaptive vacations has been analyzed. Literature related to variant multiple working vacations can be found in Ke [6], Ke et al. [7], Wang et al. [21], and Yue et al. [23]. Recently, Laxmi and Rajesh [11] studied a variant working vacations queue with customer impatience. Furthermore, the performance measures of batch arrival queue with variant working vacations and reneging have been presented in Laxmi and Rajesh [12].
In the present investigation, we carry out the analysis of an M X /M/c Bernoulli feedback queueing model with variant of multiple working vacations, reneging which depend on the states of the servers and retention of reneged customers. The queueing model presented in this paper has many practical applications. Moreover, as the impatience has strongly bad effect on the economy of any firm, a great idea of retention of impatient customers is incorporated in this work. Besides, to the best of our knowledge, modeling of multi-server queueing system with Bernoulli feedback, variant of working vacations, impatience timers which depend on the states of the servers, and retention of reneged customers has not been attempted in the literature. This paper makes a contribution in this sense.
The paper is arranged as follows. We describe the model in Sect. 2. The theoretical analysis of the system is presented in Sect. 3. Useful measures of effectiveness and the cost of our model are given in Sect. 4. To validate the analytical results and to facilitate the sensitivity analysis, we present some numerical results for system performance measures and cost model in Sect. 5. Some concluding remarks and notable features of investigation done are highlighted in Sect. 6.

The model formulation
We consider an M X /M/c queueing system with variant of working vacations, Bernoulli feedback, impatient customers which depend on the states of the servers, and retention of reneged customers. For the mathematical formulation of the queueing model, the following notations and assumptions are given: Customers arrive in batches according to a Poisson process with rate λ. The arrival batch size X is a random variable with probability mass function P(X = l) = b l ; l = 1, 2, . . . The service times during normal busy period is assumed to be exponentially distributed with mean 1/μ. During the vacation time, the service is provided according to an exponential distribution with parameter η, such that η ≤ μ. The queueing system consists of c servers, all the servers go on working vacation synchronously once the system becomes empty, and they also return to the system as one at the same time. If the servers return from working vacation period to find an empty queue, they immediately leave all together for another working vacation. Otherwise, they return to serve the queue. Working vacation periods are assumed to be exponentially distributed with mean 1/φ. At a working vacation completion instant, if there are customers in the system, the servers come back to regular busy period. Otherwise, they take all together working vacations sequentially until the maximum number of working vacations, denoted by K is taken. When the K consecutive working vacations are complete, all servers switch to normal busy period and stay idle or busy depending on the availability of the arriving batches of customers. Therefore, in variant multiple vacation policy, if the system remains empty at the end of a working vacation, the servers are permitted to take a finite number, say K , of consecutive working vacations.
Whenever a batch of customers arrives to the system and finds the servers on working vacation (respectively. busy), an independent impatience timer T 1 (respectively. T 2 ) is activated, which is exponentially distributed with parameter ξ 1 (respectively. ξ 2 ). If the customer's service has not been completed before the customer's timer expires, the customer may leave the system. Each impatient customer may abandon the system with probability α, and can be retained in the queue with complementary probability α = (1 − α). If the service is incomplete or unsatisfactory, the customer can either abandon the system with probability β or rejoin the tail of the queue of the system for another service with probability β , where β + β = 1. Note that, both customers, the newly arrived and those that are fed back are served in order in which they join the tail of the primary queue.
The inter-arrival times, batch sizes, working vacation times, service times, and impatience times are independent of each other.

Theoretical analysis of the model
Let N (t) denote the number of customers in the system at time t, and let κ(t) be the status of the servers at time t. For the mathematical representation of the proposed model at an instant t, we consider the following states of the system based on the status of the servers: j, the servers are taking the ( j + 1)th vacation at time t, j = 0, 1, K − 1, K , the servers are idle or busy at time t. Figure 1 depicts the state-transition diagram. The bi-variate process {(N (t), κ(t)), t ≥ 0} represents two-dimensional infinite state Markov chain in continuous time with state space: Let P n, j = lim t→∞ P (N (t) = n; κ(t) = j) , n ≥ 0; j = 0, K be the steady-state probabilities of the process {(N (t); κ(t)); t ≥ 0} .

PGFs and balance equations
Define the probability generating functions as follows: To develop the model, the steady-state Chapman-Kolmogorov equations for the system states are constructed as follows: The normalizing condition is given as follows: Multiplying Eqs. (1)-(4) by z n and summing all possible values of n, we get the following: In a similar manner, we get from Eqs. (5)- (8): In the same way, from Eqs. (9)-(12), we find the following: Next, using the recursive method, we get the following: ⎧ ⎨ ⎩ P n,0 = γ n P 0,0 + ϕ n P 1,K ,

Solutions of the differential equations
For z = 1 and z = 0, Eqs. (14) and (15) can be written, respectively, as follows: for j = 1, K − 1. where Now, by taking z = 1 in Eqs. (14) and (15), we, respectively, have the following: and Next, to solve the linear differential Eqs. (17) and (18), we multiply both sides of the above equations by Then, integrating form 0 to z, we obtain the following: for j = 1, K − 1. where Next, z = 0 and z = 1 are the roots of the numerator of the right-hand sides of (21) and (22). Thus, taking z = 1 in (21) and (22), respectively, we get the following: and Via Eqs. (9) and (24), we obtain the following: where Substituting Eqs. (23) and (24) in Eqs. (21) and (22), respectively, we get the following: and for j = 1, K − 1 with By taking z = 1 in Eq. (16), we find the following: Consequently, we have the following: Next, we have to solve the differential Eq. (16). Therefore, we must express recursively the quantity P n,K in terms of P 0,0 . In the same manner as previously, it yields the following: By substituting Eqs. (29) in (16), we have the following: where Multiplying Eq. (31) by e λ αξ 2 H (z) z cβμ αξ 2 and integrating from 0 to z, then using Eqs. (28) and (30), we get the following: where Now, taking z = 1 in Eq. (32), and using the normalization condition: we obtain the following: 4 Performance measures and cost model

Measures of effectiveness
Performance measures are significant features of queueing systems as they reflect the effectiveness of the considered queueing system. The queueing model developed may be of great importance using some useful characteristics which can be in the future employed for the prediction, development, and improvement of the concerned real-world queueing system. In this section, we formulate some important system performance measures in terms of steady-state probabilities.
-The average number of customers in the system (E(L)).
where E(L WV ) is the mean system size when the servers are on working vacation and E(L K ) represents the mean system size when the servers are in busy period. Differentiating Eq. (14), taking z = 1, and using Eq. (19), we get the following: In the same manner, for j = 1, K − 1, differentiating Eq. (15), taking z = 1 and using Eq. (20), we get the following: where From Eq. (34), we obtain the following: From Eq. (35), summing over all the possible values of j, j = 1, K − 1, we obtain the following: Furthermore, E(L WV ) is obtained as follows: Substituting Eqs. (36) and (37) in (38), we get the following: Next, from Eq. (16), using L'Hospital rule, we find the following: This implies that where -The mean number of customers in the queue (E(L q )): -The probability that the servers are in working vacation period (P WV ): -The probability that the servers are idle during working vacation period (P idle ): -The probability that the servers are busy (P busy ): ) P 0,0 . * The average rate of abandonment of a customer due to impatience (R a ): . * The average rate of retention of impatient customers (R e ):

Economic model
To construct the cost model, we consider the following cost (in unit) elements associated with different events: Let R be the revenue earned by providing service to a customer. Γ be the total expected cost per unit time of the system: Γ = C 1 P busy + C 2 P 0,K + C 3 P idle + C 4 P WV + C 5 E(L q ) + C 6 R a + C 7 R e +cμC 8 + cνC 9 + cβ (μ + ν)C 10 + cC 11 .

Discussion on the results
-From Table 1 and Figs. 2, 3, we see that for different values of K , along the increase of the arrival rate λ, the probability that the system becomes empty P 0,0 decreases. Thus, the mean number of customers  Table 2 and Figs. 4, 5 for different mean batch sizes 1/q. It can be observed that, for fixed q, as φ increases, the mean size of the system when the servers are in normal busy period E(L K ) increases, as intuitively expected. On the other hand, for fixed φ, E(L K ) increases with 1/q, as it should be. Thus, it is clearly obvious that the total expected profit Θ increases with the increasing of φ, while the augmentation of q implies a lost in Θ. -In Table 3 and Figs. 6, 7, we illustrate the effect of service rate during busy period μ, for various impatience rate during busy period ξ 2 . It is quite clear that with the increase in the service rate μ, the mean number of customers served augments. Thus, the total expected profit Θ increases. Obviously, the number of customers served decreases when ξ 2 increases. Thus, we have a significant total expected profit Θ for large values of μ and small values of ξ 2 . -According to the results presented in Table 4 and Figs. 8, 9, we see that the average rate of abandonment R a decreases with the increases in the service rate during vacation period ν. This is because the mean number of customers served augments with ν. Consequently, the average rate of abandonment is reduced. Furthermore, the increase in the probability of non-retention α implies an increase in R a . Finally, it is well observed that the increases in the service rate during vacation period ν and in the retention probability α have a nice impact on the total expected profit Θ. -The impact of the impatience rate during busy period ξ 2 for different values of non-feedback probabilities β is illustrated in Table 5 and Figs. 10, 11. It is clearly shown that, with the increase in impatience rate during normal busy period ξ 2 , the mean size on the system when the servers are in normal busy period E(L K ) decreases, this implies a diminution in the mean number of customers served. Consequently, the total expected profit Θ decreases. Furthermore, from the above presentations, it is well seen that the feedback probability β has a nice effect on the economy of the system. - Figures 12 and 13 plot the impatience rate during working vacation period ξ 1 for different values of number of servers c. It is well observed that when the impatience rate ξ 1 is large, the mean size of the system when the servers are on working vacation period decreases. Therefore, the mean number of customers served is reduced. This leads to a decrease in Θ. On the other hand, from Table 6, we observe that when the number of servers becomes large, the total expected profit is significant. This is due to the fact that the mean number of customers served increases with c, while the average rate of abandonment decreases with the increasing of the number of the servers.

Conclusions and future scope
In the present study, we explored reneging behavior in multi-server Bernoulli feedback queueing system with batch arrival, variant of multiple working vacations and retention of the reneged customers. For the analysis purpose, we investigated various system characteristics in terms of steady-state probabilities using the probability generating functions (PGFs). Reneging and retention probabilities incorporated in our model may play an important role in the economy of the concerned system. Numerical experiments performed can be useful and benefic to explore the impacts of system parameters on the performance measures in different contexts. The model developed may provide lucrative perspicacity to the production managers, system engineers, etc. To make the system modeling more closer to the real-world problems, an extension of our results for a non-Markovian models is a pointer to future research. Moreover, we can extend this study by incorporating the bulk failure.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http:// creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.