Present-day queuing inventory systems (QIS) do not utilize two multi-server service channels. We proposed two multi-server service channels referred to as $T1S$ (Type 1 n-identical multi-server) and $T2S$ (Type 2 m-identical multi-server). It includes an optional interconnected service connection between $T1S$ and $T2S$, which has a finite queue of size N. An arriving customer either uses the inventory (basic service or main service) for their demand, whom we call $T1$, or simply uses the service only, whom we call $T2$. Customer $T1$ will utilize the server $T1S$, while customer $T2$ will utilize the server $T2S$, and $T1$ can also get the second optional service after completing their main service. If there is a free server with a positive inventory, there is a chance that $T1$ customers may go to an infinite orbit whenever they find that either all the servers are busy or no sufficient stock. The orbital customer can request for $T1S$ service under the classical retrial policy. $Q(=S-s)$ items are replaced into the inventory whenever it falls into the reorder level s such that the inequality always holds $n<s$. We use the standard $(s,Q)$ ordering policy to replace items into the inventory. By varying S and s, we investigate to find the optimal cost value using stationary probability vector $\varphi$. We used the Neuts Matrix geometric approach to derive the stability condition and steady-state analysis with R-matrix to find $\varphi$. Then, we perform the waiting time analysis for both $T1$ and $T2$ customers using Laplace transform technique. Further, we computed the necessary system characteristics and presented sufficient numerical results.

This article deals with the queuing-inventory system, composed of c junior servers, a senior server, two finite waiting halls, and an infinite orbit. On occasion, junior servers encounter challenges during customer service. In these instances, they approach the senior server for guidance in resolving the issue. Suppose the senior server is engaged with another junior server. The approaching junior servers await their turn in a finite waiting area with a capacity of c for consultation. Concerning this, we study the performance of junior servers approaching the senior server in the retrial queuing-inventory model with the two finite waiting halls dedicated to the primary customers and the junior servers for consultation. We formulate a level-dependent QBD process and solve its steady-state probability vector using Neuts and Rao’s truncation method. The stability condition of the system is derived and the $\mathbb{R}$ matrix is computed. The optimum total cost has been obtained, and the sensitivity analyses, which include the expected total cost, the waiting time of customers in the waiting hall and orbit, the number of busy servers, and a fraction of the successful retrial rate of the model, are computed numerically.

The purpose of this article is to examine the server activation policy (SAP) in a multi-server queuing-inventory system (MQIS). The queue has a total of c number of multi-threshold stages as well as c-homogeneous servers. The activation of each server begins one by one if there is an adequate queue length and inventory in the system; otherwise, they remain idle. The server deactivation process continues until the queue length exceeds the manageable level (predetermined stages) or there is insufficient stock. In addition, when we assume the length of the two successive threshold levels is one, the server activation policy model becomes a regular multi-server model. The Neuts matrix geometric approach is used to discuss the stability condition, stationary probability vector. The Laplace–Stieltjes transform (LST) is used to analyse the waiting time distributions of the queue and orbital customers. Additionally, significant system performance metrics and sensitivity analysis are used to investigate the effects of various parameters and cost values. In the comparative result between the server activation model (SAM) and without the server activation model (WSAM) on the expected total cost, we obtain the minimised cost in the SAM. Moreover, the results are obtained by assuming that the length of the intervals between the two successive threshold levels is to be taken into account as the non-uniform length. The expected inventory level, reorder rate, and waiting time of a customer in the waiting hall and orbit were explored numerically by the parameter analysis.

This article deals with a finite-source stock-dependent stochastic inventory system with heterogeneous servers and retrial facility. The system can store up to S number of items, and the lifetime of each item follows an exponential distribution. The primary customers arrive in a finite waiting hall from a finite source and get service from the multi-channel (c-heterogeneous servers). The customer’s arrival rate depends on the present stock level. Those customers who arrive while the waiting hall is full enter into the finite orbit. Also, customers in the waiting hall can become impatient and enter the orbit. The (s,Q) ordering policy is adopted for the replenishment of stocks. In the steady state, the joint probability distribution of a number of items in the inventory, busy servers, customers in the waiting hall, and orbit is computed. The comparative numerical analysis of heterogeneous and homogeneous servers on the expected total cost, the average number of customers in the waiting hall and orbit, the fraction of successful retrial rate, and the average impatient customer rate are also carried out.

This article deals with asynchronous server vacation and customer retrial facility in a multi-server queueing-inventory system. The Poisson process governs the arrival of a customer. The system is comprised of c identical servers, a finite-size waiting area, and a storage area containing S items. The service time is distributed exponentially. If each server finds that there are an insufficient number of customers and items in the system after the busy period, they start a vacation. Once the servers vacation is over and it recognizes there is no chance of getting busy, it goes into an idle state if the number of customers or items is not sufficient, otherwise, it will take another vacation. Furthermore, each server's vacation period occurs independently of the other servers. The system accepts a (s, Q) control policy for inventory replenishment. For the steady state analysis, the Marcel F Neuts and B Madhu Rao matrix geometric approximation approach is used owing to the structure of an infinitesimal generator matrix. The necessary stability condition and R matrix are to be computed and presented. After calculating the sufficient system performance measures, an expected total cost of the system is to be constructed and numerically incorporated with the parameters. Additionally, numerical analyses will be conducted to examine the waiting time of customers in the queue and in orbit, as well as the expected rate of customer loss.