Design of reasonable initialization weighted enhanced Karnik-Mendel algorithms for centroid type-reduction of interval type-2 fuzzy logic systems

1.   Introduction

Retrial queues (RQs) with unreliable servers have been extensively investigated due to their wide range of applications in domains such as consumer service centers, computer and communications networks, and systems for production. Retrial queues can serve as an indication of consumer service demands. When consumers find an inaccessible server, they have the option to join a retry group, referred to as an orbit, and make a request for their desired services at another moment in time. To access survey papers, bibliographic information, and books, readers are referred to Falin ^[1], Artalejo ^[2], Falin and Templeton ^[3], and the references provided in these sources. Boussaha et al. ^[4] explored feedback retrial queues and orbit search with the M/G/1 queueing system. Atencia et al. ^[5] examined a non-Markovian retrial queue and discussed the customer's sojourn time in the server, system, and orbit. Jeganathan et al. ^[6] conducted an analysis of asynchronous multiple vacations using a multi-server retrial queueing inventory system. Micheal and Indhira ^[7] have analyzed a retrial queueing model with two-phase service under Bernoulli working vacations (BWV). They introduced adaptive neuro-fuzzy inference system (ANFIS) computation and cost optimization of nonlinear metaheuristics to validate their model and also compared the results with other methods, such as artificial bee colonies, genetic algorithms, and particle swarm optimization.

Queuing situations where idle servers may engage in vacations can be discovered in IT networks, machinery, and manufacturing systems, among several other domains. During a working vacation (WV) time, the server delivers its service to consumers at a slow rate, but during an ordinary vacation period, the server completely stops its service to consumers. Servi and Finn ^[8] presented a single-srever Markovian queueing system with WV. Wu and Takagi ^[9] expanded the Markovian queue with working vacation into the non-Markovian queue with WV. Gao et al. ^[10] introduced an M/G/1 retrial queue model that takes into account retrial times of a general nature, WV, and vacation interruptions. Rajadurai ^[11] examined the non-Markovian retrial queue and considered the three consumer-type categories, which are positive, negative, and priority consumers under WV policy. Yang et al. ^[12] presented a retrial queue model with WV and examined the occurrence of server failures at the start of service. Li et al. ^[13] investigated the M/G/1 type retrial queueing model, which incorporates single working vacation under Bernoulli schedule. Bouchentouf et al. ^[14] explored Markovian queues with finite capacity and differentiated working vacation (DWV). Jain et al. performed a study on Markovian queues with disaster failure and MWVs ^[15]. Murugan and Keerthana ^[16] investigated a single-server retrial queueing model that incorporates G-queue and MWV concepts. Bharathy and Saravanarajan ^[17] examined the unreliable retrial queue and two essential services using WV. Chen et al. ^[18] investigated random working vacation and improved service efficiency vacation policies using an M/G/1 queueing model.

In reality, we frequently encounter situations in which servers fail but may be repaired. Furthermore, it is thought that server failures are the most common reason for service interruptions. Similarly, there are numerous instances that take place in the domains of digital networks, manufacturing systems, production control, and other related areas. Limited maintenance capabilities and service station breakdowns can have a significant impact on system performance. Therefore, queueing systems with unreliable service stations are worth investigating from a performance prediction perspective. Rajadurai et al. ^[19] explored non-Markovian type retrial queue with multiple WV incorporating server breakdown. Varalakshmi et al. ^[20] analyzed immediate feedback single server queues with working vacations and server breakdowns and used the supplementary variable technique to find steady-state results. Rajadurai et al. ^[21] investigated the cost optimization technique of a retrial queue with K-phase optional type of service with multiple working vacations subject to server breakdown. Gao et al. ^[22] investigated a retrial queue with active and passive breakdowns and delayed repairs. Ke et al. ^[23] studied the feedback retrial queue and balking, including the server breakdown. In addition, the author used the Probabilistic Global Search Lausanne approach to solve the optimization problem. Liu et al. ^[24] presented a Markovian queue that incorporates preemptive priority and WV interruption. Recently, a multitude of authors have extensively examined the concept of delayed repair from various perspectives ^{[25,26,27,28,29,30]}.

Many queueing scenarios involve consumers being serviced repeatedly for a specific purpose. If a consumer is dissatisfied with the service, they can attempt it multiple times until it is successfully completed. These queueing models are used in stochastic modeling of various real-world, such as in data transmission and packet switching networks. Sharma ^[31] presented Bernoulli feedback retrial queue with modified vacation subject to random breakdowns. Chang et al. ^[32] investigated unreliable retrial queue, which included impatient and feedback customers. The author also examined the methods used to perform the optimization tasks, including the Nelder-Mead simplex direct search method, the pattern search method, and the quasi-Newton approach. Ayyappan et al. ^[33] analyzed the concept of a single server queue and considered the customer priority type, reneging, and immediate feedback under WV. Abdollahi et al. ^[34] investigated single-server retrial queues, first essential, and k-phase optional services that incorporate server vacation and feedback policies. Jain and Kaur ^[35] explored a bulk arrival retrial model incorporating optional service and Bernoulli feedback and utilized the maximum entropy principle (MEP) to find steady state probability and waiting time; the Quasi Newton method was also used to find the optimal cost. Wang et al. ^[36] studied the machine learning-based compressed sensing channel estimation method for wireless communications, which is important for industrial internet of things (IIoT) uses. They explored a distributed compressed sensing-based method for the sparse correlation between channels in multiple-input multiple-output filter bank multicarrier (MIMO-FBMC) with offset quadrature amplitude modulation (OQAM) systems.

Supplementary variables, representing elapsed and remaining times, determine the forward and backward Chapman-Kolmogorov equations that govern the relevant model. To manage the elapsed time, we can introduce supplementary variables that match each non-exponential governing random variable. This procedure transforms the non-Markovian process into a Markovian process by acquiring all essential information, ensuring that its present state alone determines its future. Numerous queue theorists have employed the supplementary variable technique, a widely recognized methodology in queueing theory, to address non-Markovian congestion issues in both everyday and industrial contexts. Using the approach of SVTs, Cox (1955) has examined a non-Markovian approach ^[37]. Jain et al. ^[38] surveyed the supplemental variable approach for studying M/G/1 queues with service interruptions caused by vacation or server breakdowns. Deepa and Azhagappan ^[39] used the SVT method to analyze the bulk arrival queue with optional second-phase service, including the optional re-service concept. Huang ^[40] presented an analysis of a batch arrival queue and service pattern in an optional phase with a randomized vacation concept using the SVT method.

This study presents a novel approach to modeling an unreliable server in a single arrival feedback retrial queue with reneging, and delayed repair under working vacation. The current study enhances the previous research conducted by Madhu Jain ^[41] by incorporating the novel concepts of (1) single arrival, (2) reneging, and (3) delayed repair during busy and WV periods. To the authors, best knowledge, there is no existing literature in the field of the queueing model that discusses non-Markovian queues incorporating the concepts of general retry times, single arrival, feedback, reneging, and delayed repair in both RS and WV circumstances. Our study specifically considers the problem of an unreliable service in the RS and WV modes. The fundamental motivation for developing the suggested generalized model is its potential application in real-world queueing scenarios such as communication networks and consumer care.

This article's next sections are organized as follows: Section 2 provides a detailed explanation of the system model and includes a real-life example. Section 3 presents the steady-state probabilities. Section 4 discusses the performance characteristics of the model. Section 5 examines special cases. Section 6 presents an analysis of cost optimization. Section 7 presents numerical examples that demonstrate the effects of different system performance factors. Finally, Section 8 provides the article's conclusion.

2.   Formulation of the model

In this section, we consider an M/G/1 feedback retrial queue with reneging, delayed repair, and WV subject to server breakdown. The following is an explanation of our proposed model (Figure 1), provided by

● Consumers arrival process: The consumers arrive at the queueing system following a Poisson process, with rates of $\lambda$ in the busy state and $\lambda_{v}$ in the working vacation state.

● The retrial rule: If the arriving primary consumer discovers that the server is available, the consumer starts his service instantly. However, the consumer has the option to join the orbit's retry group if the server is busy, or working vacation, or breakdown. They attempt to make repeated service requests at random times based on the "First In-First Out" discipline; this indicates that only the single customer at the head of the orbit queue can access the server. In the event that the primary customer comes first, the retrial customer is able to cancel their request and proceed to either rejoin the retrial queue with probability (prob.) $r$ or exit the system with prob. $(1-r)$. This is the behavior of the retrial consumer, also known as reneging. It was considered that the inter-retrial time is indicated by the distribution function $A(\mathfrak{t})$, while the Laplace Stieltjes Transform (LST) is denoted as $A^{*}(\hat{\upsilon})$.

● Working vacation policy: When the orbit appears to be empty, the server commences its working vacation (WV), and the vacation time follows an exponential distribution with the characteristic parameter $\theta$. When primary consumers arrive during a working vacation, the server delivers service at a slow rate. If there is any consumer present in the system during the slow speed service completion in the vacation state, the server will stop the vacation and resume the regular busy period, causing an interruption of the vacation. When a vacation period ends and there are still consumers in orbit, the server starts up normally. Otherwise, the server will take another vacation. The service time takes the form of a distribution function $N_v(\mathfrak{t})$ during the WV period and its LST is represented as $N_v^{*}(\hat{\upsilon})$.

● Regular service process: Upon the arrival of a new consumer or a retry consumer at the service station, if the server is free, it immediately commences rendering regular service to the consumers. The service time is denoted by the general distribution and its function $N_{b}(\mathfrak{t})$ and LST are represented as $N_b^{*}(\hat{\upsilon})$ and $E(N_b)$, $E(N_b)^2$ denote the first and second moments, respectively.

● Feedback rule: Following the completion of each consumer's service, dissatisfied consumers i.e., customers who are not satisfied with their service, may join the retry group with a prob. of $f \; (0\leq f \leq 1)$ or leave the system with a prob. of ${\overline{f}} = 1-f$.

● Server breakdown event: In fact, the server operating both in normal service mode and in working vacation mode is vulnerable to failures occurring at any moment, resulting in an unpredictable disruption of the service time. The durations of breakdowns in both scenarios, namely the regular and working vacation states, are followed by exponential distributions with rates $\delta$ and $\delta_v$, respectively.

● Repair process: The server repair task commences instantly upon the server's failure, whether it occurs during peak activity or on a working vacation. While undergoing repairs, the server temporarily stop its services until the repair process is finished. Note that the consumer is waiting for the remaining services after receiving assistance from the server during a breakdown. When a server encounters a failure, it undergoes repair. During the breakdown time, the server is unable to serve the consumers and is waiting for the repair process to begin, which we refer to as the server's waiting time. We define the waiting period as the delay period. The delay timings are represented by the functions $D_b(\mathfrak{t})$ and $D_v(\mathfrak{t})$, their Laplace-Stieltjes transforms are $D_b^{*}(y)$ and $D_v^{*}(y)$, and its first two moments are assumed to be $\mathfrak{w}^{(1)}$, $\mathfrak{w}^{(2)}$, and $\mathfrak{w_v}^{(1)}$, $\mathfrak{w_v}^{(2)}$, depending on the busy and working periods, respectively. Similarly, the repair times are evaluated using the distribution functions $G_b(\mathfrak{t})$ and $G_v(\mathfrak{t})$, with their Laplace-Stieltjes transforms denoted as $G_b^{*}(y)$ and $G_v^{*}(y)$, and its two moments are assumed to be $\mathfrak{g}^{(1)}$ and $\mathfrak{g}^{(2)}$, whereas the subsequent two moments are represented as $\mathfrak{g_v}^{(1)}$ and $\mathfrak{g_v}^{(2)}$, which correspond to the busy and working vacation states, respectively.

2.1.   Application

Our approach has practical application in various domains like data processing, internet access, manufacturing and industrial production systems, management of inventory systems, software, and experiments. Let's take a network of telecommunications as an example. Call centers have a significant impact on several industries and businesses in the field of telecommunications. Consumers are initiating contact with call centers by engaging in conversation with a consumer care representative (CCR). An incoming voice call is taken immediately by the idle CCR. During a voice call, if the CCR is unavailable because it is busy with other calls, the call will be temporarily held in a retrial buffer (orbit) with a finite capacity. If there is space available, the call will be handled at a later time (retrial time), according to the FCFS principle. The caller attempts to retry the call from orbit, but if they do not receive a response, they may choose to cancel their effort for service and exit the system, a process known as reneging. The service may experience electronic fails during the regular service mode (breakdown RS). Upon the end of call processing, the internet service may need the CCR to provide the same service again (feedback) in the event of any failures in the previous process. If the CCR does not detect any voice calls, it will carry out a series of maintenance tasks, such as doing virus scans (WV) on the system. During the repair time, the conventional center is equipped with various components, including an automatic call distributor (ACD) and an interactive voice response (IVR) unit (referred to as the WV server). These components are capable of handling calls at a slower rate during the working vacation period. However, it is possible that this server may experience technical issues during this period (referred to as Breakdown WV). When a server experiences a failure, it is taken out of service for repairs. This results in a temporary interruption of consumer service, termed the server's waiting time (referred to as delayed (RS, WV)). We define the duration of waiting as a period of delay. This type of retrial queue, which incorporates working vacations, serves as a reliable approximation of such for telecommunication processing systems. The suggested method can be used in modern culture, particularly in healthcare systems that use telephone consultations.

3.   Steady-state probabilities

The steady-state governing equations are derived using the SVT. The probability-generating function (PGF) was obtained for the server states and also for the number of consumers in the orbit and system.

We consider that $A(0) = 0, \; A(\infty) = 1, \; N_b(0) = 0, \; N_b(\infty) = 1, \; N_v(0) = 0, \; N_v(\infty) = 1, \; W_b(0) = 0, \; W_b(\infty) = 1, \; W_v(0) = 0, \; W_v(\infty) = 1$, are continuous at $\hat{\upsilon} = 0$ $G_b(0) = 0, \; G_b(\infty) = 1\; \text{and} \; G_v(0) = 0, \; G_v(\infty) = 1$ are continuous at $y = 0$. We assume the hazard rate functions as $\dot{a}$ $(\hat{\upsilon}), \; \beta_b (\hat{\upsilon}), \; \beta_v(\hat{\upsilon}), \; \chi_{b}(y), \; \chi_{v}(y), \; \gamma_{b}(y), \; \text{and} \; \gamma_{v}(y)$ for retrial, regular service, slow rate service, delay repair (RS, WV) and for the maintainance (RS, WV) in that order, respectively.

In addition, let $A^{0}, N_b^{0}, N_v^{0}, W_b^{0}, W_v^{0}, G_b^{0} \text{and} \; G_v^{0}$ be the expired retrial, busy, working vacation (WV), delay to repair, and repair times shown at period $\mathfrak{t}$. We also assume the random variable (RV),

$\{{S(t)}, {C(t)}; \mathfrak{t}\geq0\}$ show the bivariate Markov process, where $C(t)$ is the number of consumers in the orbit at time $\mathfrak{t}$. The function $S(t)$ denotes the server states $(0, 1, 2, 3, 4, 5, 6, 7)$ depending on if the server is unoccupied, RS, WV, delayed repair (WV, RS), and under repair (WV, RS). Let us assume that the limiting probabilities $P_0(\mathfrak{t}) = Prob.{{S(t)} = 0, C(t) = 0}$ and the prob. densities are

The time (${\mathfrak{t}_\mathfrak{n}; \mathfrak{n} = 1, 2, ...}$) represents a sequence of epochs that correspond to the completion times of WV, or the point at which the delay is resolved and the repair period concludes. A Markov chain is created by a set of random vectors ${\psi}_\mathfrak{n} = \left\lbrace {S(\mathfrak{t}n+)}, {C(\mathfrak{t}n+)}\right\rbrace$ forms a Markov chain that is embedded in the RQ system. It follows from Appendix A that $\left\lbrace {\pi}_\mathfrak{n}; \mathfrak{n}\in \mathbb{N}\right\rbrace$ is ergodic if and only if $\Gamma < 1$ for our system to be stable, where $\Gamma = f+r(1-A^{*}(\lambda)+E(N_b)(\lambda+\lambda\delta(w^{1}+g^{1})))$.

3.1.   Steady-state conditions

The governing equations are formulated using the supplementary variable approach.

When $\hat{\upsilon} = 0$ and $y = 0$, the associated boundary conditions are stated as:

The expression for normalizing condition is given as

3.2.   Steady-state solution

In this section, we derive the equation illustrating the steady-state of the RQ model by utilizing the prob. generating functions (PGFs) approach. To solve the above equations, the PGFs are defined for $|{\varsigma}|\leq 1$ in the following manner:

By multiplying equations Eqs (3.1)–(3.22) with $\varsigma^{\mathfrak{n}}$, and summing over $\mathfrak{n}$ (where $\mathfrak{n} = 0, \; 1, \; 2, \; ...$), we obtain:

Solving the partial differential Eqs (3.24)–(3.29), we get

where $A_b(\varsigma) = (\lambda (1-\varsigma)+\delta(1-W_b^{*}(b(\varsigma))G_b^{*}(b(\varsigma)))$,

$A_v(\varsigma) = (\lambda_v (1-\varsigma)+\theta+\delta_v(1-W_v^{*}(b_v(\varsigma))G_v^{*}(b_v(\varsigma)))$, $b(\varsigma) = \lambda\; (1-\varsigma)$, and $b_v(\varsigma) = \lambda_{v}\; (1-\varsigma)$.

By substituting Eqs (3.38) and (3.40) into Eq (3.32), and subsequently applying certain modifications, we obtain the following expression:

where

Using Eqs (3.39) and (3.40) in Eq (3.31), gives

Using Eq (3.39) in Eq (3.34), we get

Inserting Eq (3.40) in Eq (3.35), we obtain

Inserting the Eq (3.43) in Eq (3.36), we obtain

Using the Eq (3.44) in Eq (3.37), gives

Using Eq (3.33) and (3.45) in Eq (3.46), we obtain

Where

Using Eq (3.51) in Eq (3.45), we get

Using Eq (3.52) in Eq (3.47), we get

Using Eq (3.53) in Eq (3.49), we get

Using Eq (3.48) in Eq (3.50), we get

Likewise, Eq (3.33), Eq (3.48), and Eqs (3.51)–(3.55) are inserted into Eqs (3.38)–(3.44). Next, we calculate the findings for the following PGFs: $I(\hat{\upsilon}, \; \varsigma), \; B_{b}(\hat{\upsilon}, \varsigma), \; \phi_{v}(\hat{\upsilon}, \varsigma)$ $D_{b}(\hat{\upsilon}, 0, \varsigma), D_{v}(\hat{\upsilon}, 0, \varsigma)$, $\check{R}_b(\hat{\upsilon}, 0, \varsigma), \text{and}\; \check{R}_v(\hat{\upsilon}, 0, \varsigma)$.

Theorem 1. The prob. distributions of the number of consumers in orbit and the server states have the following PGFs.

where

Proof. By integrating equations (3.38) to (3.44) with respect to $\hat{\upsilon}$, we may determine the PGFs.

The prob. of the server being idle, denoted as $P_0$, can be calculated using the normalized condition. Therefore, by substituting $\varsigma = 1$ into Eqs (3.56) to (3.62) and following L'Hospital's rule when appropriate, we may derive $P_0+I(1)+B_b(1)+\phi_v(1)+\check{R}_b(1)+\check{R}_v(1)+D_b(1)+D_v(1) = 1.$ □

3.3.   Corollary

Under the system stability condition $(f+r(1-A^{*}(\lambda)+E(N_b)(\lambda+\lambda\delta(w^{1}+g^{1})))) < 1$, the server is unoccupied, down, WV, delayed repair or under repair; then, the PGF for the number of consumers in the orbit and system is denoted as $K_{o}(\varsigma)$ and $K_{s}(\varsigma)$, respectively.

where

4.   Performance characteristic

In this section, we examine the probabilities of the system states the server being unoccupied, RS, WV, delayed repair (RS, WV) and under maintenance (RS, WV). Also, we examine the average number of consumers in orbit $L_q$, the average number of consumers in the system $L_s$, mean availability $S_{Av}$, system failure occur $Fail_f$, average busy time $H(T_{bs})$, and average busy cycle $H(T_{bc})$ of our model.

4.1.   Probabilities of the system state

The outcomes derived from Eqs (3.56)–(3.62) are obtained by substituting $\varsigma\rightarrow 1$ and thereafter applying L-Hospital's rule as appropriate.

1) The prob. of the server remaining idle during the retrial period:

2) The prob. that the server is in RS period.

3) The prob. of the server operating at a reduced service rate:

4) The prob. that the server is delayed repair in RS:

5) The prob. that the server is delayed repair in WV:

6) The prob. that the server is undergoing maintenance in RS is determined by:

7) The prob. that the server is undergoing maintenance in WV is determined by:

4.2.   Average orbit size and system size

ⅰ) To get the number of consumers in the orbit $L_q$, we differentiate Eq (3.64) with respect to $\varsigma$ and evaluate it at $\varsigma = 1$.

where

where

ⅱ) By differentiating Eq (3.65) with respect to $\varsigma$ and evaluating it at $\varsigma = 1$, we may find the number of consumers in the system, denoted as $L_s$.

Where

ⅲ) The average time of a consumer waiting in the system $W_s = \frac{L_s}{\lambda_{eff}}$ and the average time of a consumer waiting in the orbit $W_q = \frac{L_q}{\lambda_{eff}}$ is obtained by using the Little's formula.

Where $\lambda_{eff} = \lambda(I(1)+B_b(1)+D_b(1)+R_b(1))+\lambda_v(\phi_v(1)+D_v(1)+R_v(1)).$

4.3.   Reliability measures

To enhance the reliability of a system that is susceptible to breakdowns, it is important to decide on the reliability measurements of the model. These measures offer major details into the average server availability and other relevant indices.

1) The server's mean availability $(S_{Av})$ is determined by

2) The steady-state system failure occurrence in RS is as follows:

4.4.   Average busy time and the busy cycle

Let the average length of the busy cycle and busy period $H(T_{bs}) \; \text{and}$ $H(T_{bc})$ be taken using the following method:

where the length of the system in the empty state is represented by $T_0$, and $H(T_{0}) = (1/\lambda)$. By inserting Eq (3.53) in Eq (4.10), we obtain the anticipated outcome to be

5.   Special cases

In this section, we analyze certain specific cases of our model that coincide with the current research.

Case (ⅰ) M/G/1 model with balking consumer in multiple WV mode. Choose $\delta_v = \delta; \; r = 0;\; \lambda_v = \lambda, \; \text{and} \; \zeta = 0$. In this case, we get

This matches the outcome obtained by Rajadurai et al.^[19].

Case (ⅱ) No delayed repair and reneging. Let $\zeta = r = 0,$ our approach can be simplified to a $M^{X}/G/1$ RQ with retrial feedback queue with Balking, WVs and VI. Here, $K_{s}(\varsigma)$ was obtained as

This matches the outcome obtained by Jain ^[41].

Case (ⅲ) M/G/1 model without feedback, deleyed repair, and reneging. Choose $\delta_v = 0, \; \delta = 0, \; r = 0, \; \text{and} \; f = 0$. In this case, we obtain:

This matches the outcome obtained by Gao et al. ^[10].

6.   Cost optimization

To design a retrial queueing system to perform cost analysis, the most effective course is to determine the optimal system parameters, such as the optimal mean service rate or the optimal number of servers. In this section, we discuss the optimal structure for the single-server feedback retrial queue with working vacations subject to server failure. We obtain the total expected cost function per unit time using the following definitions of cost elements ($C_{h}, C_{0}, C_{s}, \text{and}\; C_{a}$) and the cost structure:

Where $C_{h}, C_{0}, C_{s}, \text{and}\; C_{a}$ represent the holding costs per unit of time for each customer in the system, the cost per unit of time to keep the server in and on operations, the setup cost per busy cycle, and the startup cost per unit of time for setting up the server in order to begin providing the service, respectively. For the following values of the cost elements and other parameters, such as $\lambda \& \lambda_{v} = 1, \dot{a} = 2, N_{b} = 6, N_{v} = 4, \theta = 2, \chi_v \& \chi_b = 5; \gamma_v \& \gamma_b = 3,$ $f = 0.2, \delta_{v} \& \delta = 0.1, r = 0.2, C_{h} = 5, C_{o} = 80, C_{s} = 600, \text{and}\; C_{a} = 80$, we find the total expected cost per unit of time, $TC = 440.4952$, assuming exponential retrial times, service times, working vacation times, and repair times. Furthermore, Tables 1–3 show the impacts of $(C_h; C_o), (C_o; C_a),$ and $(C_s; C_a)$ on the expected cost function, respectively. It is evident that when cost parameters increase, the expected cost function trends upward linearly. Similarly, we can conduct a sensitivity study on specific system parameters. After establishing the above-mentioned base values, one parameter can be changed at a time to calculate the appropriate objective function value. The graphs from Figures 2–4 display the effect of specific system parameters $(\dot{a}, \lambda, N_v)$ on the overall expected cost per unit of time.

7.   Numerical example

In this section, we will analyze the impact of numerous variables on the efficiency indicators of our system using various numerical demonstrations.

The examples are predicated on the assumption that all instances of retrial, RS, periods of reduced service rate, delayed repair, and maintenance times follow an exponential distribution. Consequently, the parameters are chosen with arbitrary values satisfying the stability condition. The results are visually represented using MATLAB software. It is worth noting the equation of exponential distribution $f(\hat{\upsilon}) = \nu e^{-\nu \hat{\upsilon}}, \hat{\upsilon} > 0$, Erlang-2 stage distribution $f(\hat{\upsilon}) = \nu^{2} \hat{\upsilon} e^{-\nu \hat{\upsilon}}, \hat{\upsilon} > 0$, and the hyper exponential distribution $f(\hat{\upsilon}) = c \nu e^{-\nu \hat{\upsilon}}+(1-c)\nu^{2}e^{-\nu^{2} \hat{\upsilon}}, \hat{\upsilon} > 0$.

7.1.   Sensitivity analysis

The data presented in Table 4 indicates that when the rate of repeated tries $\dot{a}$ increases, there is a constant decrease in the prob. of the orbit size $L_q$ and the prob. of the server being unoccupied, while the retrial time $I$ decreases. Meanwhile, the prob. of the server being idle, denoted as $P_0$, also rises. Regarding the given values $\lambda_{v} \& \lambda = 1$; $\theta = 3$; $N_b = 8;$ $r = 0.2$; $\chi_v \& \chi_b = 4$; $\gamma_v \& \gamma_b = 4$; $\delta_{v} \& \delta = 0.3$; $f = 0.2$; $N_v = 4$; $c = 0.5$. The impacts of the prob. on the system's performance metrics are described, and documented in Table 5 for the given values of $\lambda_{v} \& \lambda = 2; \theta = 3; N_v = 4; N_b = 8; r = 0.2; \chi_v \& \chi_b = 4; \gamma_v \& \gamma_b = 4; \dot{a} = 5; f = 0.2$; $c = 0.5$. We have seen that the breakdown rate $\delta$ increases consistently as the values of the orbit size prob. $L_q$, the server unoccupied rate $P_0$, and the server idle rate during the retry period $I$ increase. The patterns exhibited by the tables align with the expected assumptions.

Specifically, in Table 6, when the lower service rate $N_v$ escalates, the server idle rate $P_0$ and length of the orbit $L_q$ also escalates, while the prob. that the server is idle during the retrial period $I$ decreases, given the values of $\lambda_{v} \& \lambda = 1; \delta_{v} \& \delta = 0.3;$ $N_b = 8; r = 0.2; \chi_v \& \chi_b = 4; \gamma_v \& \gamma_b = 4; \dot a = 5; \theta = 3; f = 0.2$; $c = 0.5$. In Table 7, when the feedback rate f rises, then the average length of the orbit Lq, the server idle during retrial period I, and server idle $P_0$ declines, relating to the values $\lambda_{v} \& \lambda = 2; \delta_{v} \& \delta = 0.3;$ $N_b = 8; r = 0.2; \chi_v \& \chi_b = 4; \gamma_v \& \gamma_b = 4; \dot a = 5; \theta = 3$; $c = 0.5$. In Table 8, when the reneging rate r rises, the average length of the orbit Lq, the server idle during retrial period I, and the server idle $P_0$ decline, regarding the specified values $\lambda_{v} \& \lambda = 1; \delta_{v} \& \delta = 0.3; N_b = 8; r = 0.2; \chi_v \& \chi_b = 4;$ $\gamma_v \& \gamma_b = 4; \dot a = 5; \theta = 3$; $c = 0.5$.

Figures 5–11 depict the influence of the variables $\lambda_{P}, \; \lambda_{N}, \; r, \; \dot a, \; \theta, \; N_b, \; \text{and}\; N_v$ on the 3D graph based on system performance metrics.

In Figure 5, the server's idle rate $P_0$ increases when both the lower service rate $N_v$ and the rate of retrial $N_b$ increase. Figure 6 demonstrate that the queue length $L_q$ lowers when the retry rate $\dot{a}$ and the rate of the working vacation $N_v$ increase. In Figure 7, the length of the queue $L_q$ increases as both the arrival rate $\lambda$ and the breakdown rate with RS $\delta$ increase. In Figure 8, the length of the queue $L_q$ increases as the server's rate of service $N_b$ increases and the rate of delay $\zeta$ drops consistently. In Figure 9, the queue length $L_q$ drops as the server's rate of service $\theta$ grows and the rate of retry $\dot{a}$ also increases. In Figure 10, the server idle rate $P_0$ drops as the feedback rate $f$ and the reneging rate $r$ grow. In Figure 11, the length of the queue $L_q$ lowers as the server's rate of $N_b$ and the rate of the slow service $N_v$ constantly grow.

Figures 12–15 illustrate the impact of the variables $\lambda_{P}, \; \lambda_{N}, \; r, \; \dot a, \; \theta, \; N_b, \; \text{and}\; N_v$ on the 2D graph based on system performance metrics. Note that the exponential distribution is $f(\hat{\upsilon}) = \nu e^{-\nu \hat{\upsilon}}, \hat{\upsilon} > 0$, Erlang-2 stage distribution is $f(\hat{\upsilon}) = \nu^{2} \hat{\upsilon} e^{-\nu \hat{\upsilon}}, \hat{\upsilon} > 0$, and the hyper-exponential distribution is $f(\hat{\upsilon}) = c \nu e^{-\nu \hat{\upsilon}}+(1-c) \nu^{2} e^{-\nu^{2} \hat{\upsilon}}, \hat{\upsilon} > 0$. Figure 12 demonstrates a positive correlation between the increase in the slow service rate $N_v$ and the growth of the prob. of server idle rate $P_0$. The graph in Figure 13 illustrates that the prob. of the server being idle, denoted as $P_0$, decreases as the feedback rate, represented by $f$, increases. Figure 14 illustrates that the average size of orbit $L_q$ exhibits an upward trend as the reneging rate $r$ increases. Figure 15 illustrates that the average size of orbit $Lq$ decreases as the repair rate $\zeta$ increases. The following data visualizations illustrate the influence of the attributes on the system.

7.2.   Limitations

The proposed retrial queueing model incorporating working vacations, breakdowns, and repairs offers a comprehensive framework for analyzing service systems. However, like any model, it possesses inherent limitations and underlying assumptions that can influence the interpretation of the results.

The model frequently assumes that the retrial queue has an endless capacity. This makes analysis easier but might not accurately represent real-world situations. In reality, users may completely give up on the system if they believe that wait times are too lengthy. This may cause the model's average waiting times to increase. Usually, the model focuses on a system with just one server. This can be helpful for tractability, but in multi-server setups, complicated relationships and problems with resource allocation occur. The model may assume that service hours, arrival rates, and other related variables are fixed. However, demand and service requirements fluctuate in real-world systems. We can establish the suggested approach results in a more effective system with shorter wait times for customers, better server utilization, and less downtime from malfunctions by looking at these measures. In the proposed model, we can further extend the concepts of bulk arrival queue, optional phase service, and N-policy.

8.   Conclusions

In this study, we have analyzed a non-Markovian feedback retrial queue, reneging, delayed repair, and working vacation subject to server breakdown, along with server failures that occur during service time for consumers in both normal service mode and working vacation mode. The PGFs for the number of consumers in the system during various states such as server unoccupied, occupied, on WV, delayed repair, and under repair have been obtained by using the SVT approach. Furthermore, the explicit expression for the mean queue length of both the orbit and the system was derived. We examined the probabilities of the system states and discussed some significant special cases. The utilization of numerical results in sensitivity analysis can assist decision-makers in analyzing the functioning of the system in various circumstances. Also, decision-makers and system developers in the relevant industries and service organizations will use the results of the cost analysis to help them make the best and most economical choices regarding the upgrading and capacity expansion of the service systems in consideration. The inspiration for this model comes from its widespread use in real-life systems, such as computer and telephone networks, where a single server handles messages while utilizing the working vacation policy.

Author contributions

Sundarapandiyan S.: Study design, conceptualization, methodology, formal analysis, visualization, software and writing-original draft. Nandhini S.: Study design, conceptualization, validation, methodology, formal analysis, visualization, software and supervision. All authors have read and approved the final version of the manuscript for publication.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this manuscript.