Modeling of Junior Servers Approaching a Senior Server in the Retrial Queueing-Inventory System

Preprint

Article

Modeling of Junior Servers Approaching a Senior Server in the Retrial Queueing-Inventory System

Altmetrics

Downloads

112

Views

Comments

A peer-reviewed article of this preprint also exists.

Jeganathan Kathirvel,

Harikrishnan Thanushkodi

,Lakshmanan Kumarasankaralingam,Agassi Melikov,

Janos Sztrik^*

Jeganathan Kathirvel,

Harikrishnan Thanushkodi

,Lakshmanan Kumarasankaralingam,Agassi Melikov,

Janos Sztrik^*

This version is not peer-reviewed

Submitted:

18 October 2023

Posted:

19 October 2023

You are already at the latest version

Alerts

Abstract

This article deals with the queueing-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 queueing-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 R matrix is computed. Optimum total cost has been obtained, and sensitivity analyses, which include expected total cost, waiting time of customers in waiting hall and orbit, number of busy servers, and fraction of successful retrial rate of the model, are done numerically.

Keywords:

Subject: Computer Science and Mathematics - Probability and Statistics

1. Introduction

Over the past two decades, researchers have dedicated significant efforts to developing a range of queueing-inventory models. In this paper, we introduce a distinctive queueing-inventory model characterized by a novel feature: Junior servers can seek guidance from senior servers when facing challenges in customer service. This interactive dynamic injects a fresh perspective into the conventional server-customer relationship. Within this innovative system, junior servers, though proficient in their roles, have the option to consult senior servers when encountering complexities in customer interactions. This collaborative approach, akin to seeking mentorship from a seasoned expert, enhances the efficiency and problem-solving capabilities of the queueing-inventory framework. This research aims to thoroughly investigate this intriguing model, scrutinizing its performance and the intricate interplay between junior and senior servers. Ultimately, it offers invaluable insights into the dynamics of this specialized queueing-inventory system.

1.1. Motivation

The considered queueing-inventory model was developed based on the real-life experience of one of the authors. When the author went to purchase an android from the local multi-brand mobile showroom located in Chennai, junior sales executives received him. While the junior executive explained the features of mobile, the author asked a query regarding the credit card offer. Unfortunately, a junior executive couldn’t address the issue. So the junior executive seeks help from the senior executive. Then, junior and senior executives together addressed the author’s query. The incident happened in the author’s life and motivated him to develop the retrial queueing-inventory model where less experienced junior servers assist customers by approaching the experienced senior server.

1.2. Literature Review

Positive service time was originally introduced by Melikov and Molchanov [24] as well as Sigman and Simchi-Levi [34] within the context of inventory modeling. They considered a facility that utilizes inventory to cater to customers, with the service time being distributed arbitrarily. Yadavalli et al. [40] conducted an analysis on a perishable inventory model employing continuous review and a multi-server service configuration with MAP. Additionally, they took into account a separate group of negative customers following an independent MAP. In this setup, a negative customer displaces one of the existing customers in the queue. Under

(s, S)

ordering policy, Yadavalli et al. [41] examined a multi-server service facility with the inventory system in the finite population in which any arriving customer who finds if all the servers are busy then the customer sent to the orbit. Nair et al. [25] studied the behaviour of a two-dimensional multi-server queueing-inventory system (QIS) with

(s, S)

ordering policy. When there are at least

s + 1

customers in the system, they guarantee a minimal service with rate

(s + 1) μ

. Krishnamoorthy et al. [21] assumed that the customer may receive an item at the end of the service under Bernoulli’s schedule in the QIS with a multi-server facility. For the original two unbounded level challenges, Wang [38] proposed two modeling approximations. They applied enumerative and quasi-Newton search methods in a heuristic manner to fine-tune the quantity of stock, servers, reorder thresholds, and both service and a retrial facility. Wang et al. [39] studied priority type multi-server inventory model with identical service time distribution. For the case of non-identical service rates, generalized stochastic Petri net (GSPN) models have been used. When service rates are the same, they demonstrate how the two approaches are equivalent.

Hanukov et al. [12] analyzed an inventory model denoted as

M / M / 2

, where customer interest is piqued by observing the quantity of available stocks. Jeganathan et al. [15] conducted a comparative study on a Markovian inventory model employing dual servers, examining both homogeneous and heterogeneous server configurations. Their numerical results underscored the superior efficiency of the heterogeneous system. Suganya and Sivakumar [36] delved into a QIS featuring retrials, incorporating two distinct servers and incorporating vacation periods. In this scenario, customers arrive following a MAP, and the two concurrent servers offer services in different phases. Jose and Beena [20] investigated a production inventory system employing two servers of differing capabilities, considering retrial customers and allowing for server vacations. One server had the flexibility for multiple breaks, while the other operated continuously without any time off. The assumption was made that either when the inventory’s stock level reaches zero or when both conditions are met, the servers would go on vacation. Chakravarthy and Rumyantsev [7] explored batch demands within two distinct models. Both models assumed that demands followed a Markovian point process. In the first model, if a customer arrived and found the inventory level at zero, the customer would be lost. In the second model, any waiting customers would be lost when the inventory reached zero. Jeganathan and Reiyas [16] analyzed delayed and modified working vacations in the QIS with two distinct servers in which the first server is capable of executing a modified working vacation and the second server can engage in a delayed working vacation.

Chakravarthy et al. [8] investigated a QIS with infinite servers and a queue with a size of infinite. They assumed the self-service facility under exponential distribution and MAP for customer arrival in the system. Hanukov et al. [11] studied the preparatory service in order to decrease the waiting time of customers during the idle time in a multi server QIS with stock dependent arrival. Jeganathan et al. [17] considered two groups of multi servers in such a way that each group of servers is designed to operate for two types of customer. First type of customers can purchase the commodity whereas the second type can receive the service only. Rasmi et al. [30] addressed a multi-server queuing-inventory system featuring diverse customer types (K in total) arriving in accordance with a marked Markovian arrival process. Each customer class seeks a distinct type of service, and distinct priorities are allocated to each class. Rasmi and Jacob [29] explored a Markovian QIS with c servers and self-service feature is optionally available. Service for the customers is initiated whenever an item and a server is available. In the event that a customer arrives to find all servers occupied but free inventory is still accessible, they have the choice to either wait in line for a server or opt for self-service. In the multi-server production inventory system, when the on-hand inventory level drops to zero, an immediate replenishment of one item is initiated as an emergency measure to meet customer demands, with no lead time was considered by Shajin et al. [33]. Jeganathan et al. [18] studied a queueing-inventory model offering sales of fresh and refurbished items and service alone to the customers managed by the dedicated servers.

Almaqbali et al. [2] analyzed a batch arrival and service pattern for the customers. If there are j customers in batch it is called category j and

j = 1, 2, \dots, k

. A customer in category j can receive service only when j items are in stock. Aghsami et al. [1] proposed a multi-server queuing-inventory model based on the hospital blood bank considering the request for blood as arrival and blood as inventory. Selvakumar et al. [32] analyzed the home delivery service facility in the QIS considering two distinct servers. The first server was always available in the system in order to maintain the sales of items and the second server was used for the delivery process of purchased items who is offered vacation facility. Yue et al. [42] conducted a study on a multi-server QIS with a vacation policy. In this setup, a subset of servers take a collective vacation once the on-hand inventory is exhausted. After each vacation period, if there is still inventory available, these servers return to the system to resume serving customers.

The retrial QIS finds extensive applications across various domains, including supply chain and manufacturing systems. Artalejo et al. [4] pioneered the incorporation of the retry strategy of customers into stochastic inventory systems, examining numerical solutions and optimal decision-making. Building upon this work, Ushakumari [37] investigated a QIS with retrials and random lead time, deriving the optimal ordering point. Amirthakodi and Sivakumar [3] examined a QIS with a finite queue and assumed that unsatisfied customers could potentially enter an orbit, where they could attempt service directly if the server is available. The authors investigated the distribution of waiting times for both the queue and retrial queues. Lopez-Herrero and Jesus [22] focused on assessing waiting durations, reorder intervals, and the duration of a pending request within a finite retrial group. Hanukov [9] proposed that customers have the option to move to the orbit during their service, making more efficient use of their time. Sugapriya et al. [35] examined the stock-dependent demand in a retrial QIS. Melikov et al. [23] assumed that in the event of a primary customer arriving when the inventory level is zero, this customer would, according to the Bernoulli scheme, either depart from the system or enter an unbounded buffer to reiterate their request at a later time.

Nithya et al. [28] introduced controlled arrivals in a retrial QIS with an essential interruption and an intermittently available server. Reiyas and Jeganathan [31] conducted a study on a standard retrial QIS that incorporates a two-component demand rate. Jain and Kumar [13] carried out an analysis of the optimization of costs in a QIS with two-level supply modes, retrial demands, and numerous vacations. To achieve this optimization, the researchers employed a genetic algorithm. Jeganatahan et al. [14] studied the classical retrial queueing model with scrap items where the server takes a vacation once the storage becomes full or no customer in the queue. Bazizi et al. [5] explored the optimization of an

(s, Q)

retrial inventory system with partial backlogging demands using a generalized stochastic Petri net approach. Very recently, Jeganathan et al. [19] studied the asynchronous vacation policy in the retrial QIS with

(s, Q)

ordering policy.

1.3. Research Gap

The previously mentioned studies have explored various service configurations within the QIS. However, there is currently no published research in the queueing-inventory domain specifically addressing scenarios where junior servers consult the senior server on behalf of customers. Moreover, there is a scarcity of literature on queueing models involving junior servers approaching the senior server. Chakaravarthy [6] investigated a queueing model where the primary server (senior server) not only serves customers directly but also provides guidance to other servers (junior servers). Junior servers can seek advice only while actively assisting a customer, and the senior server addresses these requests in the order they are received. Priority is given to regular service over consultations, even if it requires interrupting their service to customers. Recently, Hanukov [10] examined a queueing model involving n multi-servers. Initially, a junior server handles the first phase, which may involve gathering information or providing an initial service. The junior server then collaborates with a senior server to complete the service together. However, if the senior server is already assisting another junior server, the latter must join a queue along with other servers awaiting the availability of the senior server.

To fill this research gap, we present an innovative model featuring a team of c junior servers working alongside a senior server in the QIS, implementing the

(s, Q)

ordering policy. We conduct a thorough examination of its performance and distinctive attributes.

1.4. Novelty and Contribution of the Model

Innovative Service Configuration: This research introduces a unique stochastic retrial queueing-inventory system where junior servers take on a dual role, functioning both as servers and consultants as per the specific circumstances.
Analysis of the System: The paper contributes by utilizing the Neuts and Rao truncation method to solve the level-dependent QBD and Neuts matrix geometric method to establish the stability condition and calculate the stationary probability vector.
Comprehensive Performance Analysis: Through rigorous numerical analysis, the study delves into various critical aspects including the expected total cost, waiting time, and the workload of junior servers. This detailed investigation provides practical insights into the system’s operational efficiency under different modes of operation for junior servers.

Overall, this research advances the understanding of stochastic retrial QIS by proposing an innovative service approach, employing a specialized analytical method, and conducting a thorough performance assessment. It contributes significantly to both theoretical and practical domains within queueing-inventory modeling.

The subsequent sections of this paper are organized as follows: Section 2 outlines the specific assumptions underlying our proposed model. In Section 3, we provide the mathematical formulation and conduct an in-depth analysis of the model. Section 4 calculates the R matrix and the probability vector in a steady state. We establish a set of metrics to evaluate the system’s performance in Section 5. The model’s effectiveness is evaluated through numerical analysis in Section 6, and we conclude with a summarizing section in Section 7.

2. Model Description

2.1. Notations

\begin{matrix} 0 & : & A matrix where all entries are zero \\ e & : & A column vector of appropriate dimensions, with each coordinate set to one \\ I & : & An identity matrix \\ δ_{i j} & : & Kronecker - Delta \\ {\bar{δ}}_{i j} & : & 1 - δ_{i j} \\ H (x) & : & Heaviside function \\ ω_{a}^{b} & : & a, a + 1, \dots, b, where a and b are integers \\ ω_{a}^{\infty} & : & a, a + 1, \dots where a be an integer \end{matrix}

2.2. Model Formulation

The study examines an inventory system characterized by a maximum storage capacity of S items, two physical queues with capacities N and c and an infinite capacity virtual waiting area (Orbit). The primary customers arrive at the waiting area of size N under the Poisson process at a rate of

λ

. Consider a case in which the waiting hall is overflowing when the primary customer arrives. The primary customer enters the infinite orbit. The customer in the orbit always tries to enter the waiting hall. The retrial is successful when the waiting hall size is less than N. The duration between consecutive attempts of orbital customers, known as the inter-retrial time, is estimated by an exponential distribution with the rate

θ

and it occurs under the classical retrial policy. The system employs a group of c junior servers to serve customers, with an additional senior server available to assist juniors facing difficulties during service. The service time of each junior server follows an exponential distribution with the parameter

μ

. Junior servers can operate in two modes: server mode (S-mode) and consultant mode (C-mode).

When the junior server takes on the duty of offering service to the customers in the waiting hall, he performs the role of a server, known as server mode (S-mode).
When a junior server seeks assistance from the senior server in solving the encountered problem in S-mode, the junior server undertakes the role of a consultant, known as consultant mode (C-mode).

If a customer arrives and the inventory is available with at least one free junior server, the service begins immediately. However, if the inventory is empty or all junior servers are occupied, the customer must wait in the waiting area (if the waiting area is not full). If the junior server successfully serves the customer (i.e., no issues arise), having completed the purchase, the customer exits the system with probability p. In cases where the junior server encounters a problem during service, they approach the senior server for consultation. In such a situation, the customer remains in the waiting area, and the junior server, acting on the customer’s behalf, enters the queue of size c dedicated for the junior servers to consult with the senior server with a probability of q. The junior server informs the issue faced in S-mode to the senior server when he is available. Upon providing a comprehensive explanation of the matter to the senior server, a collaborative effort is undertaken by the senior server and the junior server to successfully provide the service. Upon completion, the customer leaves the system after making a purchase of an item, and the junior server transitions back from C-mode to S-mode. The duration of this service follows an exponential distribution with a rate of

α

. If both the inventory and customer (excluding the servicing customer) are available, the junior server immediately resumes service in S-mode. Otherwise, they remain idle in S-mode. When the junior server approaches the senior server and finds the senior server is assisting some other junior server, the junior server is required to wait in the waiting area of size c until it is their time to be served.

The system follows a

(s, Q)

ordering policy, where an order for

Q (= S - s)

items is placed from an external supplier as soon as the inventory level reaches the designated threshold, s. The lead time for orders also follows an exponential distribution. The relationship between the number of junior servers and the reorder point is defined as

c < s

. The flow chart of the considered model is given in Figure 1.

3. Mathematical Analysis

Consider the following random variables

{\tilde{A}}_{1} (t), {\tilde{A}}_{2} (t), {\tilde{A}}_{3} (t)

and

{\tilde{A}}_{4} (t)

, representing the number of customers in the orbit at time t, number of customers in the waiting hall at time t, number of junior servers in C-mode at time t, number of items in the inventory at time t, respectively. The collection

A (t) = {({\tilde{A}}_{1} (t), {\tilde{A}}_{2} (t), {\tilde{A}}_{3} (t), {\tilde{A}}_{4} (t)) : t \geq 0}

constitutes a four-dimensional stochastic process with the state space

P = ⋃_{i = 1}^{2} P_{i}

where

P_{1} = {({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4}) ∣ {\overset{˘}{a}}_{1} \in ω_{0}^{\infty}, {\overset{˘}{a}}_{2} \in ω_{0}^{c}, {\overset{˘}{a}}_{3} \in ω_{0}^{{\overset{˘}{a}}_{2}}, {\overset{˘}{a}}_{4} \in ω_{{\overset{˘}{a}}_{3}}^{S}}

P_{2} = {({\overset{˘}{a}}_{1}, {\overset{˘}{0}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4}) ∣ {\overset{˘}{a}}_{1} \in ω_{a}^{\infty}, {\overset{˘}{a}}_{2} \in ω_{c + 1}^{N}, {\overset{˘}{a}}_{3} \in ω_{0}^{c}, {\overset{˘}{a}}_{4} \in ω_{{\overset{˘}{a}}_{3}}^{S}}

The stochastic process

A (t)

, which is characterized by discrete state space and continuous time, exhibits the Markov property. Furthermore, it can be shown that any state in P is accessible from any other state. Therefore, we may classify

A (t)

as a continuous time irreducible Markov chain (CTIMC). The CTIMC is described by the infinitesimal generator matrix given below.

\begin{matrix} T = \begin{matrix} 0 & 1 & 2 & 3 & 4 & \dots \\ 0 & ( & T_{0, 0} & T_{0, 1} & ) \\ 1 & T_{1, 0} & T_{1, 1} & T_{0, 1} \\ 2 & T_{2, 0} & T_{2, 2} & T_{0, 1} \\ 3 & T_{3, 0} & T_{3, 3} & T_{0, 1} \\ ⋮ & ⋱ & ⋱ & ⋱ \end{matrix} \end{matrix}

(1)

where the

T_{0, 1}

matrix symbolizes the transitions of the customers joining the orbit. This happens when a primary customer arrives, and there is no place for customers in the waiting hall.

T_{01} = \{\begin{matrix} λ I_{(c + 1) S + 1 - \frac{c (c - 1)}{2}} & {\overset{˘}{a}}_{1} = 0, 1, \dots; {\overset{˘}{a}}_{1}^{'} = {\overset{˘}{a}}_{1} + 1; \\ {\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ 0 & Otherwise \end{matrix}

The matrices

T_{{\overset{˘}{a}}_{1}, 0}

for

{\overset{˘}{a}}_{1} = 1, 2, \dots

represent the transitions of retrial customers entering the waiting hall.

For

{\overset{˘}{a}}_{1} = 1, 2, 3, \dots

T_{{\overset{˘}{a}}_{1}, 0} = \{\begin{matrix} {\overset{˘}{a}}_{1} θ I_{S + 1 - {\overset{˘}{a}}_{3}} & {\overset{˘}{a}}_{2} = 0, 1, \dots, c - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ {\overset{˘}{a}}_{3} = 0, 1, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{1} θ I_{S + 1 - {\overset{˘}{a}}_{3}} & {\overset{˘}{a}}_{2} = c, c + 1, \dots, N - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ {\overset{˘}{a}}_{3} = 0, 1, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ 0 & Otherwise \end{matrix}

The matrices

T_{{\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{1}}

for

{\overset{˘}{a}}_{1} = 0, 1, 2, \dots

represent the transitions of all other remaining parameters, and the entries along the diagonal are populated by the total sum of elements in their respective rows, with an opposite sign, to ensure that the sum of all row entries equals zero.

For

{\overset{˘}{a}}_{1} = 0, 1, 2, \dots

T_{{\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{1}} = \{\begin{matrix} D_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ D_{c} & {\overset{˘}{a}}_{2} = c + 1, c + 2, \dots, N - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ D_{N} & {\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ F_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ F_{c} & {\overset{˘}{a}}_{2} = c, c + 1, \dots, N - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ E_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 1, 2, 3, \dots, c; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} - 1; \\ E_{c + 1} & {\overset{˘}{a}}_{2} = c + 1, c + 2, \dots, N; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} - 1; \\ 0 & Otherwise \end{matrix}

For

{\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c

D_{{\overset{˘}{a}}_{2}} = \{\begin{matrix} β & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, s; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} + Q; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + β + {\overset{˘}{a}}_{1} θ + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{2} {\overset{˘}{a}}_{3}} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + H (s - {\overset{˘}{a}}_{4}) β + {\overset{˘}{a}}_{1} θ + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

D_{N} = \{\begin{matrix} β & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, s; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} + Q; \\ ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, c; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ (c - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = c + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + β + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{3} c} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, c; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + H (s - {\overset{˘}{a}}_{4}) β + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ (c - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = c + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

For

{\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c

F_{{\overset{˘}{a}}_{2}} = \{\begin{matrix} λ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

For

{\overset{˘}{a}}_{2} = 1, 2, \dots, c

E_{{\overset{˘}{a}}_{2}} = \{\begin{matrix} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) p μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) p μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ α & {\overset{˘}{a}}_{3} = 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} - 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ 0 & Otherwise \end{matrix}

E_{c + 1} = \{\begin{matrix} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) p μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, c; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ (c - {\overset{˘}{a}}_{3}) p μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = c + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ α & {\overset{˘}{a}}_{3} = 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} - 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} - 1; \\ 0 & Otherwise \end{matrix}

3.1. Neuts and Rao Matrix Geometric Approximation

The structure of equation (1) indicates that the assumed Markov chain, denoted as

{A (t), t \geq 0}

, conforms to the level-dependent QBD process. To solve this system, we employ Neuts and Rao’s truncation method [27], which involves capping the orbit level at a specified point, denoted as M. This truncation shifts the system from being level-dependent to level-independent. Essentially, the equilibrium of the system is determined by setting

T_{{\overset{˘}{a}}_{1}, 0} = T_{M, 0}

and

T_{{\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{1}} = T_{M, M}

for all

{\overset{˘}{a}}_{1} \geq M

. In this scenario, the modified generator matrix for

{A (t), t \geq 0}

is given by

\begin{matrix} \hat{T} & = & (\begin{matrix} T_{01} & T_{10} & 0 & 0 & 0 & \dots & 0 & 0 & 0 & 0 & 0 & \dots \\ T_{10} & T_{11} & T_{10} & 0 & 0 & \dots & 0 & 0 & 0 & 0 & 0 & \dots \\ 0 & T_{20} & T_{22} & T_{10} & 0 & \dots & 0 & 0 & 0 & 0 & 0 & \dots \\ ⋮ & ⋮ & ⋮ & ⋮ & ⋮ & ⋱ & ⋮ & ⋮ & ⋮ & ⋮ & ⋮ & ⋱ \\ 0 & 0 & 0 & 0 & 0 & \dots & T_{M 0} & T_{M M} & T_{10} & 0 & 0 & \dots \\ 0 & 0 & 0 & 0 & 0 & \dots & 0 & T_{M 0} & T_{M M} & T_{10} & 0 & \dots \\ ⋮ & ⋮ & ⋮ & ⋮ & ⋮ & ⋱ & ⋮ & ⋮ & ⋮ & ⋮ & ⋮ & ⋱ \end{matrix}), \end{matrix}

In order to get the necessary stationary probability vector, we use the rate matrix

T^{*}

, which is generated by this equation

T^{*} = T_{M 0} + T_{M M} + T_{10}

and is given by

T^{*} = \{\begin{matrix} {\hat{D}}_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ {\hat{D}}_{c} & {\overset{˘}{a}}_{2} = c + 1, c + 2, \dots, N - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ {\hat{D}}_{N} & {\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2}; \\ {\hat{F}}_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ {\hat{F}}_{c} & {\overset{˘}{a}}_{2} = c, c + 1, \dots, N - 1; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} + 1; \\ E_{{\overset{˘}{a}}_{2}} & {\overset{˘}{a}}_{2} = 1, 2, 3, \dots, c; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} - 1; \\ E_{c + 1} & {\overset{˘}{a}}_{2} = c + 1, c + 2, \dots, N; {\overset{˘}{a}}_{2}^{'} = {\overset{˘}{a}}_{2} - 1; \\ 0 & Otherwise \end{matrix}

For

{\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c

{\hat{D}}_{{\overset{˘}{a}}_{2}} = \{\begin{matrix} β & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, s; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} + Q; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2} - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + β + M θ + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{2} {\overset{˘}{a}}_{3}} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + H (s - {\overset{˘}{a}}_{4}) β + M θ + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, {\overset{˘}{a}}_{2}; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{2} 0} {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

{\hat{D}}_{N} = \{\begin{matrix} β & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, s; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4} + Q; \\ ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1, \dots, c; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ (c - {\overset{˘}{a}}_{3}) q μ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c - 1; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3} + 1; \\ {\overset{˘}{a}}_{4} = c + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + β + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\bar{δ}}_{{\overset{˘}{a}}_{3} c} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, c; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ - [λ + H (s - {\overset{˘}{a}}_{4}) β + & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ (c - {\overset{˘}{a}}_{3}) μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] & {\overset{˘}{a}}_{4} = c + 1, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

For

{\overset{˘}{a}}_{2} = 0, 1, 2, \dots, c

{\hat{F}}_{{\overset{˘}{a}}_{2}} = \{\begin{matrix} λ + M θ & {\overset{˘}{a}}_{3} = 0, 1, 2, \dots, c; {\overset{˘}{a}}_{3}^{'} = {\overset{˘}{a}}_{3}; \\ {\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}, \dots, S; {\overset{˘}{a}}_{4}^{'} = {\overset{˘}{a}}_{4}; \\ 0 & Otherwise \end{matrix}

Theorem 1.

The steady state probability vector ψ to the matrix

T^{*}

is given by

ψ^{({\overset{˘}{a}}_{2})} = ψ^{(0)} χ_{{\overset{˘}{a}}_{2}} \forall {\overset{˘}{a}}_{2} \in ω_{0}^{N}

(2)

where

χ_{0} = I; χ_{i} = \prod_{j = 1}^{i} Γ_{j}

Γ_{j} = \{\begin{matrix} - {\hat{F}}_{j - 1} {[{\hat{D}}_{j} + Γ_{j + 1} E_{j + 1}]}^{- 1} & j \in ω_{1}^{c} \\ - {\hat{F}}_{c} {[{\hat{D}}_{c} + Γ_{j + 1} E_{c + 1}]}^{- 1} & j \in ω_{c + 1}^{N - 1} \\ - {\hat{F}}_{c} {\hat{D}}_{N}^{- 1} & j = N \end{matrix}

and

ψ^{(0)}

is obtained by solving the equations

ψ^{(0)} ({\hat{D}}_{0} + Γ_{1} E_{1})

(3)

\sum_{{\overset{˘}{a}}_{2} = 0}^{N} ψ^{(0)} e = 1 .

(4)

Proof.

The probability vector

p s i

in steady state satisfies the below equations:

\begin{matrix} ψ T^{*} & = 0, \end{matrix}

(5)

\begin{matrix} ψ e & = 1 . \end{matrix}

(6)

In Equation (5), after explicitly expressing

ψ

and

T^{*}

and simplifying it, we arrive at the

N + 1

set of equations as follows:

\begin{matrix} ψ^{({\overset{˘}{a}}_{2})} {\hat{D}}_{{\overset{˘}{a}}_{2}} + ψ^{({\overset{˘}{a}}_{2} + 1)} E_{{\overset{˘}{a}}_{2} + 1} & = 0, {\overset{˘}{a}}_{2} = 0 \end{matrix}

(7)

\begin{matrix} ψ^{({\overset{˘}{a}}_{2} - 1)} {\hat{F}}_{{\overset{˘}{a}}_{2} - 1} + ψ^{({\overset{˘}{a}}_{2})} {\hat{D}}_{{\overset{˘}{a}}_{2}} + ψ^{({\overset{˘}{a}}_{2} + 1)} E_{{\overset{˘}{a}}_{2} + 1} & = 0, {\overset{˘}{a}}_{2} \in ω_{0}^{c} \end{matrix}

(8)

\begin{matrix} ψ^{({\overset{˘}{a}}_{2} - 1)} {\hat{F}}_{c} + ψ^{({\overset{˘}{a}}_{2})} {\hat{D}}_{c} + ψ^{({\overset{˘}{a}}_{2} + 1)} E_{c + 1} & = 0, {\overset{˘}{a}}_{2} \in ω_{c + 1}^{N - 2} \end{matrix}

(9)

\begin{matrix} ψ^{({\overset{˘}{a}}_{2} - 1)} {\hat{F}}_{c} + ψ^{({\overset{˘}{a}}_{2})} {\hat{D}}_{{\overset{˘}{a}}_{2}} & = 0, {\overset{˘}{a}}_{2} = N - 1 \end{matrix}

(10)

The steady-state probability vectors

ψ^{({\overset{˘}{a}}_{2})}

for all

{\overset{˘}{a}}_{2}

in the set

ω_{0}^{N}

are obtained by solving the system of Equations (7) and (10) iteratively. This allows us to express these vectors in terms of the steady-state probability vector

ψ^{(0)}

as shown in Equation (2). Solving the equations (3) and (4), we get

ψ^{(0)}

and using the vector

ψ^{(0)}

obtain

ψ

. □

Theorem 2.

The inequality

\sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} ψ^{(M, N, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} λ < \{\sum_{{\overset{˘}{a}}_{2} = 0}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} + \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N - 1} \sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S}\} ψ^{(M, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} M θ

(11)

gives the stability condition for the infinitesimal generator matrix,

\hat{T}

Proof.

Based on the result given by Neuts [26], The existence of a steady-state probability vector

ψ

for the modified infinitesimal generator matrix

\hat{T}

is dependent upon the fulfilment of the following condition.

ψ T_{0, 1} e < ψ T_{M, 0} e .

(12)

Through the above Theorem (1) in inequality (12) and writing elaborately on all

ψ

T_{0, 1}

T_{M, 0}

and

e

and simplifying it, the required stability condition in (11) is obtained. □

3.2. Limiting Probability Distribution

The generating matrix T yields the steady-state probability vector

φ = (φ^{(0)}, φ^{(1)}, φ^{(2)}, \dots)

, which meets the stability requirement. Consequently, the Markov process denoted as

\{({\tilde{A}}_{1} (t), {\tilde{A}}_{2} (t), {\tilde{A}}_{3} (t), {\tilde{A}}_{4} (t)), t \geq 0\},

with a state space denoted as P, is classified as regular. Hence, the ultimate probability distribution, denoted as

\begin{matrix} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} = & lim_{t \to \infty} P r [{\tilde{A}}_{1} (t) = {\overset{˘}{a}}_{1}, {\tilde{A}}_{2} (t) = {\overset{˘}{a}}_{2}, {\tilde{A}}_{3} (t) = {\overset{˘}{a}}_{3}, {\tilde{A}}_{4} (t) = {\overset{˘}{a}}_{4} | \\ {\tilde{A}}_{1} (0) = 0, {\tilde{A}}_{2} (0) = 0, {\tilde{A}}_{3} (0) = 0, {\tilde{A}}_{4} (0) = 0] . \end{matrix}

, exists and is observed to be independent of the initial state.

4. Computation of $R$ Matrix

To obtain the steady-state probability vector

φ = (φ^{(0)}, φ^{(1)}, φ^{(2)}, \dots)

, it is essential to calculate the rate matrix

R

Theorem 3.

The rate matrix

R

is the minimal non-negative solution of the matrix quadratic equation

T_{M, 0} R^{2} + T_{M, M} R + T_{0, 1} = 0,

(13)

and the

R

matrix structure is

R = \begin{array}{l} 0 \\ 1 \\ ⋮ \\ N - 1 \\ N \end{array} (\begin{matrix} \begin{matrix} 0 & 1 & \dots & S - 1 & S \\ 0 & 0 & \dots & 0 & 0 \\ 0 & 0 & \dots & 0 & 0 \\ ⋮ & ⋮ & \dots & ⋮ & ⋮ \\ 0 & 0 & \dots & 0 & 0 \\ A^{(0)} & A^{(1)} & \dots & A^{(N - 1)} & A^{(N)} \end{matrix} \end{matrix})

(14)

For

{\overset{˘}{a}}_{2} \in ω_{0}^{N}

A^{({\overset{˘}{a}}_{2})} = \begin{array}{l} 0 \\ 1 \\ ⋮ \\ c - 1 \\ c \end{array} (\begin{matrix} \begin{matrix} 0 & 1 & \dots & c - 1 & c \\ ℜ_{{\overset{˘}{a}}_{2}}^{0, 0} & ℜ_{{\overset{˘}{a}}_{2}}^{0, 1} & \dots & ℜ_{{\overset{˘}{a}}_{2}}^{0, c - 1} & ℜ_{{\overset{˘}{a}}_{2}}^{0, c} \\ ℜ_{{\overset{˘}{a}}_{2}}^{1, 0} & ℜ_{{\overset{˘}{a}}_{2}}^{1, 1} & \dots & ℜ_{{\overset{˘}{a}}_{2}}^{1, c - 1} & ℜ_{{\overset{˘}{a}}_{2}}^{1, c} \\ ⋮ & ⋮ & \dots & ⋮ & ⋮ \\ ℜ_{{\overset{˘}{a}}_{2}}^{c - 1, 0} & ℜ_{{\overset{˘}{a}}_{2}}^{c - 1, 1} & \dots & ℜ_{{\overset{˘}{a}}_{2}}^{c - 1, c - 1} & ℜ_{{\overset{˘}{a}}_{2}}^{c - 1, c} \\ ℜ_{{\overset{˘}{a}}_{2}}^{c, 0} & ℜ_{{\overset{˘}{a}}_{2}}^{c, 1} & \dots & ℜ_{{\overset{˘}{a}}_{2}}^{c, c - 1} & ℜ_{{\overset{˘}{a}}_{2}}^{c, c} \end{matrix} \end{matrix})

(15)

For

u, v \in ω_{0}^{c}

\begin{matrix} ℜ_{{\overset{˘}{a}}_{2}}^{u, v} = \begin{array}{l} u \\ u + 1 \\ ⋮ \\ S - 1 \\ S \end{array} (\begin{matrix} v & v + 1 & \dots & S - 1 & S \\ ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u, v} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u, v + 1} & \dots & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u, S - 1} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u, S} \\ ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u + 1, v} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u + 1, v + 1} & \dots & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u + 1, S - 1} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{u + 1, S} \\ ⋮ & ⋮ & \dots & ⋮ & ⋮ \\ ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S - 1, v} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S - 1, v + 1} & \dots & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S - 1, S - 1} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S - 1, S} \\ ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S, v} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S, v + 1} & \dots & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S, S - 1} & ϑ_{{\overset{˘}{a}}_{2}, u, v}^{S, S} \end{matrix}) \end{matrix}

(16)

Proof.

The matrix quadratic equation (13) is fulfilled by the rate matrix

R

, which is constructed based on the block tridiagonal structure of the infinitesimal modified generating matrix

\hat{T}

. At first, it is presumed that (14) contains the unknown

R

-matrix. In fact, the

R

-matrix structure may be determined simply by counting the number of non-zero rows in the

T_{0, 1}

matrix. Since each row in the final block of the

T_{0, 1}

matrix contains at least one non-zero element, all of the rows in the final block of the

R

-matrix should be regarded as non-zero rows. These presumptions lead to the structure of the unknown

R

-matrix being as shown in (14). The following set of non-linear homogeneous equations is derived by using each block matrix in equation (13).

{\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} \in ω_{0}^{N}; {\overset{˘}{a}}_{3} \in ω_{0}^{c - 1}; {\overset{˘}{a}}_{3}^{'} \in ω_{0}^{c}; {\overset{˘}{a}}_{4} \in ω_{{\overset{˘}{a}}_{3}}^{c}; {\overset{˘}{a}}_{4}^{'} \in ω_{{\overset{˘}{a}}_{3}^{'}}^{S};

[λ + β + δ_{0 {\overset{˘}{a}}_{4}} {\overset{˘}{a}}_{4} μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + β ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{Q + {\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + δ_{{\overset{˘}{a}}_{4} 0} q ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) μ ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + λ δ_{{\overset{˘}{a}}_{2}^{'} N} = 0

(17)

{\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} \in ω_{0}^{N}; {\overset{˘}{a}}_{3} \in ω_{0}^{c - 1}; {\overset{˘}{a}}_{3}^{'} \in ω_{0}^{c}; {\overset{˘}{a}}_{4} \in ω_{c + 1}^{S}; {\overset{˘}{a}}_{4}^{'} \in ω_{{\overset{˘}{a}}_{3}^{'}}^{S};

[λ + H (s - {\overset{˘}{a}}_{4}) β + c μ + {\bar{δ}}_{{\overset{˘}{a}}_{3} 0} α] ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + H (s - {\overset{˘}{a}}_{4}) β ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{Q + {\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + q (c - {\overset{˘}{a}}_{3}) μ ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + λ δ_{{\overset{˘}{a}}_{2}^{'} N} = 0

(18)

{\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} \in ω_{0}^{N}; {\overset{˘}{a}}_{3} = c; {\overset{˘}{a}}_{3}^{'} \in ω_{0}^{c}; {\overset{˘}{a}}_{4} \in ω_{{\overset{˘}{a}}_{3}}^{c}; {\overset{˘}{a}}_{4}^{'} \in ω_{{\overset{˘}{a}}_{3}^{'}}^{S};

[λ + β + α] ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + β ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{Q + {\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + λ δ_{{\overset{˘}{a}}_{2}^{'} N} = 0

(19)

{\overset{˘}{a}}_{2} = N; {\overset{˘}{a}}_{2}^{'} \in ω_{0}^{N}; {\overset{˘}{a}}_{3} = c; {\overset{˘}{a}}_{3}^{'} \in ω_{0}^{c}; {\overset{˘}{a}}_{4} \in ω_{c + 1}^{S}; {\overset{˘}{a}}_{4}^{'} \in ω_{{\overset{˘}{a}}_{3}^{'}}^{S};

[λ + H (s - {\overset{˘}{a}}_{4}) β + α] ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{{\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + H (s - {\overset{˘}{a}}_{4}) β ϑ_{{\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{3}^{'}}^{Q + {\overset{˘}{a}}_{4}, {\overset{˘}{a}}_{4}^{'}} + λ δ_{{\overset{˘}{a}}_{2}^{'} N} = 0

(20)

Solving the above set of equations (17), (18), (19), and (20), by Gauss-Seidel Method, we obtain the exact entries of rate matrix

R

. □

Theorem 4.

The probability vector

φ^{({\overset{˘}{a}}_{1})}, \forall {\overset{˘}{a}}_{1} = 1, 2, 3, \dots

of the Markov chain can be derived by

φ^{({\overset{˘}{a}}_{1})} = \{\begin{matrix} φ^{(0)} Λ_{{\overset{˘}{a}}_{1}} & \forall {\overset{˘}{a}}_{1} = 0, 1, 2, \dots, M \\ φ^{(0)} Λ_{M} R^{{\overset{˘}{a}}_{1} - M} & \forall {\overset{˘}{a}}_{1} > M \end{matrix}

where

R

is the solution of the matrix quadratic equation (13) and

Λ_{{\overset{˘}{a}}_{1}} = \{\begin{matrix} I & if {\overset{˘}{a}}_{1} = 0 \\ \prod_{i = 0}^{{\overset{˘}{a}}_{1}} T_{0, 1} A_{i} & if {\overset{˘}{a}}_{1} = 1, 2, \dots, M \end{matrix}

where

X_{j} = \{\begin{matrix} - {(T_{0, 1} X_{j + 1} T_{j + 2, 0} + T_{(j + 1), (j + 1)})}^{- 1} & \forall j = 0, 1, \dots, M - 2 \\ {[- T_{M, M} + R T_{M, 0})]}^{- 1} & \forall j = M - 1 \end{matrix}

and

φ^{(0)} = {[I + \sum_{{\overset{˘}{a}}_{1} = 1}^{M - 1} \prod_{j = 0}^{i - 1} T_{0, 1} X_{j} + \prod_{j = 0}^{M - 1} T_{0, 1} X_{j} {(I - R)}^{- 1}]}^{- 1}

Proof.

Let

φ = (φ^{(0)}, φ^{(1)}, φ^{(2)}, \dots)

be a probability vector which satisfies

\begin{matrix} φ \hat{T} = 0 and φ e = 1 . \end{matrix}

(21)

Let us use the matrix geometric method to solve the (21). Let us consider a rate matrix R which is the solution of the matrix quadratic equation

R^{2} T_{M, 0} + R T_{M, M} + T_{0, 1} = 0

. Let us assume that

\begin{matrix} φ^{({\overset{˘}{a}}_{1})} = φ^{(M)} R^{({\overset{˘}{a}}_{1} - M)} & \forall {\overset{˘}{a}}_{1} = M, M + 1, \dots . \end{matrix}

(22)

Solving

φ T^{*} = 0

, we get the following system of equations

\begin{matrix} φ^{(0)} T_{0, 0} + φ^{(1)} T_{1, 0} & = 0 \end{matrix}

(23)

\begin{matrix} φ^{({\overset{˘}{a}}_{1} - 1)} T_{0, 1} + φ^{({\overset{˘}{a}}_{1})} T_{{\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{1}} + φ^{({\overset{˘}{a}}_{1} + 1)} T_{{\overset{˘}{a}}_{1} + 10} & = 0 \forall {\overset{˘}{a}}_{1} = 1, 2, \dots, n - 1 \end{matrix}

(24)

\begin{matrix} φ^{(M - 1)} T_{0, 1} + φ^{(M)} (T_{M, M} + R T_{M, 0}) & = 0 \end{matrix}

(25)

\begin{matrix} and [\sum_{{\overset{˘}{a}}_{1} = 0}^{M - 1} φ^{({\overset{˘}{a}}_{1})} + φ^{(M)} {(I - R)}^{- 1}] e & = 1 . \end{matrix}

(26)

From (25)

φ^{(M)} = φ^{(M - 1)} T_{0, 1} X_{M - 1}

, where

X_{M - 1} = {[- (T_{M, M} + R T_{M, 0})]}^{- 1} .

From (24)

φ^{(M - 1)} = φ^{(M - 2)} T_{0, 1} X_{M - 2}

, where

X_{M - 2} = {[- (T_{(M - 1) \times (M - 1)} + T_{0, 1} G_{M - 1} T_{M, 0})]}^{- 1}

Using again (24), similarly we get

φ^{(M - 2)} = φ^{(M - 3)} T_{0, 1} X_{M - 3}

where

X_{M - 3} = {[- (T_{(M - 2), (M - 2)} + T_{0, 1} X_{M - 2} T_{M, 0})]}^{- 1}

In general

\begin{matrix} φ^{({\overset{˘}{a}}_{1})} = φ^{({\overset{˘}{a}}_{1} - 1)} T_{0, 1} X_{{\overset{˘}{a}}_{1} - 1} \forall {\overset{˘}{a}}_{1} = 1, 2, \dots, M \end{matrix}

(27)

where

X_{{\overset{˘}{a}}_{1}} = \{\begin{matrix} {[- (T_{M, M} + R T_{M, 0})]}^{- 1} & {\overset{˘}{a}}_{1} = M - 1 \\ {[- (T_{{\overset{˘}{a}}_{1}}, {\overset{˘}{a}}_{1} + T_{0, 0} A_{{\overset{˘}{a}}_{1}} T_{{\overset{˘}{a}}_{1} + 1, 1})]}^{- 1} & {\overset{˘}{a}}_{1} = 1, 2, \dots, M - 2 \end{matrix}

From 27

\begin{matrix} φ^{({\overset{˘}{a}}_{1})} = φ^{(0)} Λ_{{\overset{˘}{a}}_{1}} \forall {\overset{˘}{a}}_{1} = 0, 1, 2, \dots, M \end{matrix}

(28)

ℵ_{{\overset{˘}{a}}_{1}} = \{\begin{matrix} I & if {\overset{˘}{a}}_{1} = 0 \\ \prod_{i = 0}^{{\overset{˘}{a}}_{1}} T_{0, 1} A_{i} & if {\overset{˘}{a}}_{1} = 1, 2, \dots, M \end{matrix}

(29)

Substitute (28) in (25), we get

\begin{matrix} φ^{(0)} [I + \sum_{{\overset{˘}{a}}_{1} = 0}^{M - 1} ℵ_{{\overset{˘}{a}}_{1}} + ℵ_{M} {(I - R)}^{- 1}] e = 1 \end{matrix}

(30)

substitute 29 in (30), we get

\begin{matrix} φ^{(0)} = {[I + \sum_{{\overset{˘}{a}}_{1} = 1}^{M - 1} \prod_{i = 0}^{{\overset{˘}{a}}_{1} - 1} T_{0, 1} X_{i} + \prod_{i = 0}^{M - 1} T_{0, 1} X_{i} {(I - R)}^{- 1}]}^{- 1} . \end{matrix}

(31)

Using (31) in (28) we can obtain each

φ^{(i)}

. □

5. System Performance Measures

In this section, various performance measures of the system are defined to construct the total cost function and to illustrate numerical examples.

Mean Inventory level:

$Ž_{1} = \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 0}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{4} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{4} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Reorder Rate:

$Ž_{2} = \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2} - 1} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) p μ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, s + 1)} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c - 1} (c - {\overset{˘}{a}}_{3}) p μ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, s + 1)} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 1}^{{\overset{˘}{a}}_{2}} α φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, s + 1)} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 1}^{c} α φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, s + 1)}$
Mean Number of Customers in Waiting Hall:

$Ž_{3} = \sum_{{\overset{˘}{a}}_{1} = 1}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 0}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{2} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{2} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Number of Customers Enter into the Waiting Hall:

$Ž_{4} = \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 0}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} λ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N - 1} \sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} λ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Waiting Time of Customers in Waiting Hall:

$Ž_{5} = \frac{Ž_{3}}{Ž_{4}}$
Mean Number of Junior Servers in C-mode:

$Ž_{6} = \sum_{{\overset{˘}{a}}_{1} = 1}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 1}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{3} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 1}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{3} φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Number of Junior Servers Enter into C-mode:

$Ž_{7} = q μ [\sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2} - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1}^{{\overset{˘}{a}}_{2}} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2} - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1}^{S} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1}^{c} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c - 1} \sum_{{\overset{˘}{a}}_{4} = c + 1}^{S} (c - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}]$
Mean Waiting Time of Junior Servers in C-mode:

$Ž_{8} = \frac{Ž_{6}}{Ž_{7}}$
Mean Number of Busy Junior Servers in S-mode:

$Ž_{9} = \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2} - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1}^{{\overset{˘}{a}}_{2}} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = 1}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2} - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{2} + 1}^{S} ({\overset{˘}{a}}_{2} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c - 1} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3} + 1}^{c} ({\overset{˘}{a}}_{4} - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N} \sum_{{\overset{˘}{a}}_{3} = 0}^{c - 1} \sum_{{\overset{˘}{a}}_{4} = c + 1}^{S} (c - {\overset{˘}{a}}_{3}) φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Number of Ideal Junior Servers in S-mode:

$Ž_{10} = c - (Ž_{6} + Ž_{9})$
Mean Number of Customers in the Orbit:

$Ž_{11} = \sum_{{\overset{˘}{a}}_{1} = 1}^{M - 1} φ^{({\overset{˘}{a}}_{1})} e + (M φ^{(M)} {(I - R)}^{- 1} + φ^{(M)} R {(I - R)}^{- 2}) e$
Mean Number of Customers Enter into Orbit:

$Ž_{12} = \sum_{{\overset{˘}{a}}_{1} = 0}^{\infty} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} λ φ^{({\overset{˘}{a}}_{1}, N, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})}$
Mean Waiting Time of Customers in Orbit:

$Ž_{13} = \frac{Ž_{11}}{Ž_{12}}$
Successful Rate of Retrial:

$Ž_{14} = \sum_{{\overset{˘}{a}}_{1} = 1}^{M - 1} \sum_{{\overset{˘}{a}}_{2} = 0}^{c} \sum_{{\overset{˘}{a}}_{3} = 0}^{{\overset{˘}{a}}_{2}} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{1} θ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + \sum_{{\overset{˘}{a}}_{1} = 1}^{M - 1} \sum_{{\overset{˘}{a}}_{2} = c + 1}^{N - 1} \sum_{{\overset{˘}{a}}_{3} = 0}^{c} \sum_{{\overset{˘}{a}}_{4} = {\overset{˘}{a}}_{3}}^{S} {\overset{˘}{a}}_{1} θ φ^{({\overset{˘}{a}}_{1}, {\overset{˘}{a}}_{2}, {\overset{˘}{a}}_{3}, {\overset{˘}{a}}_{4})} + (M θ φ^{(M)} {(I - R)}^{- 1} + φ^{(M)} θ R {(I - R)}^{- 2}) e$
Overall Rate of Retrial:

$Ž_{15} = θ Ž_{11}$
Fraction of Successful Rate of Retrial:

$Ž_{16} = \frac{Ž_{14}}{Ž_{15}}$

5.1. The Expected Total Cost

The expected total expenditure of the considered queueing-inventory system is defined as

E_{T C} = c_{1} Ž_{1} + c_{2} Ž_{2} + c_{3} Ž_{3} + c_{4} Ž_{6} + c_{5} Ž_{11} + c_{6} Ž_{9} + c_{7} Ž_{10}

(32)

where

c_{1}

refers to the expense associated with holding each unit of an item.

c_{2}

signifies the cost incurred for setting up each unit of an item.

c_{3}

represents the cost accrued for each customer in the waiting hall per unit of time.

c_{4}

denotes the cost incurred for each junior server in C-mode per unit of time.

c_{5}

pertains to the cost accrued for each customer in orbit per unit of time.

c_{6}

represents the expenditure linked to each engaged junior server.

c_{7}

signifies the cost associated with each idle junior server.

6. Cost Analysis and Numerical Illustration

The study will employ the system’s cost and parameter values to analyze the four-dimensional stochastic multi-server QIS under examination. The investigation will involve the study of total cost, active servers, the proportion of successful retrial rate, and waiting times for customers in the orbit, waiting area, and servers in both S-mode and C-mode, by varying the parameters. Based on the results obtained from stability conditions and the normalizing property, the following parameters and costs of the Markov process are assumed:

S = 28; s = 10; c h = 0.008; c s = 1; c o = 0.1; c w = 2; c j = 2; c b = 2; c i = 1; Q = S - s; N = 6; c = 3; M = 100; p = 0.5; q = 1 - p; θ = 0.9; λ = 1; μ = 3; α = 8; β = 2;

for the analysis of the numerical discussions.

6.1. Analysis on the Expected Total Cost

In this section, the expected total cost is analyzed under the parameters. The obtained convex in Figure 2 ensures the model’s efficiency. The impacts of each parameter on

E_{T C}

are given in the Table 2 to Table 3. The characteristics of the parameters are listed below:

As the arrival rate $λ$ rises, there is a notable upswing in $E_{T C}$ due to the increased presence of customers inside the waiting hall.
Elevating the probability value p hinders junior servers from approaching their senior counterparts. As a result, customers inside the waiting hall tend to depart promptly at the end of service in S-mode, resulting in a decrease in $E_{T C}$ .
With an increase in the retry rate $θ$ , the anticipated orbit level diminishes as an increasing number of customers enter the waiting area. Since the expected orbit level correlates with total cost, this leads to a reduction in $E_{T C}$ .
Higher service rates $μ$ and $α$ lead to a drop in each customer’s mean service duration. Consequently, Ž₃ decreases, contributing to a decrease in $E_{T C}$ .
Raising the rate $β$ results in a decrease in the average lead time per order. Consequently, the expected total cost decreases.
Altering the number of junior servers in the system incurs additional expenses. Hence, an increase in c leads to an increase in $E_{T C}$ .
An expansion in the waiting hall size corresponds to a rise in Ž₃. As a result, the overall cost exhibits a positive correlation with the parameter N.

Expected total cost is a pivotal measure utilized to assess and enhance the effectiveness of a system. The efficiency of the model is significantly influenced by factors like the service rate, reorder rate, and the quantity of servers.

Table 1.

E_{T C}

μ, α

and p

Table 1.

E_{T C}

μ, α

and p

$μ$	$α$	p	0.25	0.50	0.75	1.00
3	7	6.031736	5.065806	4.594173	4.313232	4.126693
	8	5.939920	5.006762	4.550207	4.278155	4.097510
	9	5.870337	4.961519	4.516374	4.251100	4.074969
4	7	5.488890	4.714822	4.332903	4.105023	3.953676
	8	5.396855	4.655079	4.288480	4.069652	3.924297
	9	5.326736	4.609159	4.254219	4.042323	3.901571
5	7	5.171290	4.506030	4.176982	3.980651	3.850284
	8	5.078740	4.445875	4.132323	3.945139	3.820815
	9	5.008045	4.399572	4.097844	3.917677	3.798003

Table 2.

E_{T C}

λ

θ

β

and p

Table 2.

E_{T C}

λ

θ

β

and p

$λ$	$θ$	$β$	p	0.25	0.50	0.75	1.00
1.0	0.1	2	5.941777	5.006924	4.550238	4.278163	4.097513
		3	5.935194	5.002773	4.547378	4.276104	4.095999
		4	5.931683	5.000643	4.545962	4.275120	4.095300
	0.5	2	5.940224	5.006786	4.550212	4.278156	4.097510
		3	5.933647	5.002635	4.547351	4.276097	4.095996
		4	5.930138	5.000505	4.545936	4.275112	4.095297
	0.9	2	5.939920	5.006762	4.550207	4.278155	4.097510
		3	5.933346	5.002612	4.547347	4.276096	4.095995
		4	5.929838	5.000481	4.545932	4.275111	4.095297
1.5	0.1	2	7.539386	5.970785	5.263147	4.848807	4.575142
		3	7.524784	5.960969	5.255680	4.842871	4.570300
		4	7.516844	5.955703	5.251778	4.839841	4.567878
	0.5	2	7.514470	5.968412	5.262689	4.848674	4.575092
		3	7.499993	5.958607	5.255224	4.842738	4.570250
		4	7.492103	5.953344	5.251322	4.839708	4.567828
	0.9	2	7.509099	5.967982	5.262613	4.848653	4.575084
		3	7.494679	5.958184	5.255149	4.842718	4.570243
		4	7.486809	5.952924	5.251248	4.839688	4.567821
2.0	0.1	2	9.652635	7.022696	6.000656	5.429878	5.058704
		3	9.623882	7.005369	5.987205	5.418726	5.049210
		4	9.609102	6.996062	5.980050	5.412893	5.044321
	0.5	2	9.563897	7.005378	5.997239	5.428880	5.058325
		3	9.534545	6.988206	5.983825	5.417744	5.048842
		4	9.519482	6.978943	5.976676	5.411911	5.043953
	0.9	2	9.532591	7.002251	5.996667	5.428720	5.058266
		3	9.503364	6.985142	5.983269	5.417590	5.048786
		4	9.488287	6.975898	5.976124	5.411758	5.043898

Table 3.

E_{T C}

c, N

and p

Table 3.

E_{T C}

c, N

and p

c	N	p	0.25	0.50	0.75	1.00
3	6	5.939920	5.006762	4.550207	4.278155	4.097510
	7	5.943270	5.007606	4.550499	4.278280	4.097572
	8	5.945190	5.008096	4.550672	4.278356	4.097610
4	6	7.328508	6.329089	5.816626	5.504202	5.293634
	7	7.328949	6.329197	5.816658	5.504214	5.293639
	8	7.329114	6.329223	5.816665	5.504216	5.293640
5	6	8.678503	7.621454	7.063953	6.717419	6.480568
	7	8.678304	7.621446	7.063953	6.717419	6.480568
	8	8.678374	7.621456	7.063955	6.717420	6.480568

6.2. Analysis on Mean Waiting Time of Customers in the Waiting Hall

This section analyzes the customer’s waiting time in the waiting hall and orbit under the parameter variation shown in Table 6 to Table 9. Each parameter is varied under the probability p.

As the waiting hall size N is enlarged, there is an observed rise in waiting time attributable to an increase in Ž₄.
Augmenting the service rates for both junior and senior servers reduces their average service period. Hence, customer’s waiting time decreases.
An escalation in the arrival rate $λ$ corresponds to an uptick in primary arrivals, leading to an increase in Ž₃. Likewise, as the retry rate $θ$ rises, orbiting customers transition into the waiting hall, influencing Ž₅.
It is a well-established fact that an augmentation in the number of servers generally leads to a decrease in waiting time. Accordingly, the parameter c is reflected in Ž₅.
Increasing the rate $β$ results in a reduction in the average lead time per order and Ž₅ diminishes.

By thoroughly analyzing waiting times in a waiting hall, businesses and organizations can implement strategies to enhance customer satisfaction, optimize operations, and improve overall service quality.

Table 4. Ž₅ vs

λ

θ

and p

Table 4. Ž₅ vs

λ

θ

and p

$λ$	$θ$	p	0.25	0.50	0.75	1.00
1	0.7	0.818034	0.676300	0.576869	0.503096	0.446129
	0.9	0.818077	0.676309	0.576872	0.503096	0.446130
	1.1	0.818122	0.676322	0.576876	0.503098	0.446130
1.5	0.7	0.853010	0.693696	0.587304	0.510087	0.451152
	0.9	0.853583	0.693816	0.587331	0.510093	0.451153
	1.1	0.854016	0.693942	0.587372	0.510108	0.451159
2	0.7	0.944325	0.730811	0.606190	0.521327	0.458600
	0.9	0.949729	0.731874	0.606448	0.521392	0.458614
	1.1	0.952303	0.732582	0.606687	0.521479	0.458648

Table 5. Ž₅ vs c,

β

and p

Table 5. Ž₅ vs c,

β

and p

c	$β$	p	0.25	0.50	0.75	1.00
2	1	0.894707	0.718120	0.603122	0.521038	0.459102
	2	0.894216	0.717907	0.602988	0.520932	0.459009
	3	0.894138	0.717889	0.602984	0.520932	0.459010
3	1	0.818223	0.676429	0.576976	0.503191	0.446218
	2	0.818040	0.676300	0.576870	0.503096	0.446129
	3	0.818026	0.676296	0.576868	0.503095	0.446129
4	1	0.810804	0.672472	0.574604	0.501661	0.445179
	2	0.810654	0.672354	0.574502	0.501568	0.445092
	3	0.810646	0.672351	0.574501	0.501567	0.445092

Table 6. Ž₅ vs N,

μ

α

and p

Table 6. Ž₅ vs N,

μ

α

and p

N	$μ$	$α$	p	0.25	0.50	0.75	1.00
5	2	7	1.203648	0.779707	0.579805	0.461953	0.384052
		8	1.178165	0.765030	0.569407	0.453902	0.377485
		9	1.159069	0.753881	0.561460	0.447727	0.372437
	3	7	0.841619	0.551896	0.411114	0.327681	0.272442
		8	0.817536	0.537408	0.400787	0.319667	0.265897
		9	0.799442	0.526400	0.392894	0.313520	0.260864
	4	7	0.669833	0.439553	0.327314	0.260796	0.216771
		8	0.645964	0.425118	0.317012	0.252796	0.210233
		9	0.628029	0.414150	0.309138	0.246659	0.205206
6	2	7	1.208293	0.780137	0.579873	0.461968	0.384057
		8	1.182238	0.765400	0.569464	0.453914	0.377489
		9	1.162759	0.754211	0.561510	0.447738	0.372440
	3	7	0.842290	0.551948	0.411122	0.327683	0.272442
		8	0.818072	0.537448	0.400793	0.319668	0.265897
		9	0.799896	0.526432	0.392899	0.313521	0.260864
	4	7	0.670011	0.439567	0.327317	0.260797	0.216771
		8	0.646091	0.425128	0.317013	0.252796	0.210233
		9	0.628128	0.414157	0.309139	0.246659	0.205207
7	2	7	1.223024	0.782166	0.580291	0.462086	0.384098
		8	1.195385	0.767176	0.569825	0.454015	0.377524
		9	1.174808	0.755817	0.561834	0.447827	0.372471
	3	7	0.845365	0.552284	0.411189	0.327701	0.272449
		8	0.820602	0.537717	0.400845	0.319683	0.265902
		9	0.802076	0.526660	0.392943	0.313533	0.260869
	4	7	0.671008	0.439674	0.327338	0.260803	0.216773
		8	0.646849	0.425206	0.317029	0.252800	0.210235
		9	0.628743	0.414219	0.309151	0.246662	0.205208

6.3. Analysis of Mean Waiting Time for Customer in the Orbit

The mean waiting time for the customers in the orbit is analyzed in this section for each parameter under the variation of P shown in Table 7 to Table 9. The impact of parameters is listed below:

By increasing N, the waiting hall offers more space, allowing orbital customers to transition into the waiting hall. As a result, their waiting time is reduced.
Elevating the service rates for both junior and senior servers leads to a reduction in their average service time. Consequently, customers in the waiting hall tend to leave promptly, creating room for orbital customers to enter. This leads to a reduction in the waiting time for orbital customers.
An increase in $λ$ signifies a rise in primary arrivals, causing Ž₃ to also increase. This, in turn, results in an extended Ž₁₃.
Similarly, as the rate $θ$ rises, orbital customers move into the waiting hall, decreasing the Ž₁₃.
It is a well-established fact that augmenting the number of servers generally leads to a decrease in waiting time. Therefore, the parameter c contributes optimizing Ž₁₃.
The rate of parameter $β$ is being increased. It is associated with a reduction in the lead time per order that minimizes Ž₁₃.

The examination provides valuable insights into minimizing the waiting time for customers in the orbit. Ultimately, these parameters impact the efficiency of waiting times for customers in the waiting hall and also affect the orbit. A decrease in the waiting time for orbital customers leads to an increase in the business’s profitability.

Table 7. Ž₁₃ vs N,

μ

α

and p

Table 7. Ž₁₃ vs N,

μ

α

and p

N	$μ$	$α$	p	0.25	0.50	0.75	1.00
5	2	7	17.974591	16.126918	15.134281	14.557830	14.196432
		8	17.385102	15.680368	14.769172	14.246196	13.923038
		9	16.951712	15.348465	14.494552	14.008187	13.709900
	3	7	15.496179	14.688288	14.214487	13.819129	13.354706
		8	15.039793	14.342994	13.940541	13.577170	13.084691
		9	14.697968	14.073332	13.711969	13.357540	12.824969
	4	7	14.823263	14.195999	13.603035	12.876039	11.961140
		8	14.464449	13.938156	13.340046	12.460582	11.545646
		9	14.175495	13.699796	13.059647	12.004922	11.494981
6	2	7	15.398444	13.833228	12.987423	12.502860	12.217659
		8	14.886138	13.443967	12.670814	12.235936	11.988846
		9	14.509286	13.154461	12.432376	12.031705	11.810049
	3	7	13.290115	12.611500	12.260900	12.051000	11.885700
		8	12.899227	12.324800	12.051900	11.904900	11.787000
		9	12.606572	12.101900	11.879100	11.771100	11.680400
	4	7	12.721641	12.279487	11.983881	11.707888	11.390321
		8	12.432918	12.114537	11.906196	11.672482	11.338833
		9	12.205155	11.968338	11.815081	11.598996	11.229460
7	2	7	12.982237	11.655100	10.927200	10.508000	10.264500
		8	12.537662	11.316500	10.653400	10.279400	10.070800
		9	12.210647	11.064900	10.447500	10.104900	9.920400
	3	7	11.171236	10.580468	10.287446	10.142443	10.073247
		8	10.836051	10.338327	10.114754	10.028237	10.010985
		9	10.586480	10.152566	9.976379	9.929820	9.918257
	4	7	10.654105	10.297545	10.115627	10.042687	10.05909
		8	10.410305	10.163202	10.069510	10.034289	10.00849
		9	10.224213	10.053975	9.024084	9.0077514	8.925115

Table 8. Ž₁₃ vs

λ, θ

and p

Table 8. Ž₁₃ vs

λ, θ

and p

$λ$	$θ$	p	0.25	0.50	0.75	1.00
1	0.7	6.168542	4.411438	3.410960	2.348533	1.446406
	0.9	5.039675	3.494077	2.670702	1.839568	1.137603
	1.1	4.338611	2.932733	2.217329	1.524989	0.944842
1.5	0.7	9.004800	7.463500	6.438000	4.978400	3.376200
	0.9	7.149300	5.759400	4.923600	3.820000	2.612900
	1.1	6.016700	4.733400	4.010400	3.113900	2.141300
2	0.7	16.816769	15.988781	15.693862	14.625320	12.438549
	0.9	12.899227	11.969791	11.634857	10.840719	9.288518
	1.1	10.564923	9.601746	9.246775	8.601285	7.401879

Table 9. Ž₁₃ vs

c, β

and p

Table 9. Ž₁₃ vs

c, β

and p

c	$β$	p	0.25	0.50	0.75	1.00
2	1	35.941785	29.674531	28.507375	28.603095	29.006031
	2	16.676209	13.582353	12.923631	12.734906	12.420229
	3	4.417784	2.637320	1.175358	0.480075	0.234289
3	1	28.543326	27.075633	27.309766	27.759411	28.048548
	2	12.899227	11.969791	11.634857	10.840719	9.288518
	3	2.656402	0.945474	0.300075	0.131414	0.080402
4	1	26.155253	25.882732	26.404486	26.976858	27.352461
	2	11.639618	11.124192	10.458458	8.803575	6.357663
	3	1.770459	0.466486	0.145741	0.071584	0.049899

6.4. Analysis on Mean Waiting Time of Junior Servers in C-Mode

This section analyzes a parameter analysis on the mean waiting time of junior servers in C-mode. The impact of parameters can be seen in Table 10 to Table 12. and is listed below

As the rate of consumer arrivals increases, there is a corresponding growth in the quantity of customers present in the waiting area. As a result, there is an increased probability of junior servers operating in C-mode, hence resulting in a corresponding rise in their waiting duration.
Similarly, an increase in the retrial rate $θ$ allows orbital customers to transition into the waiting hall, resulting in an increase in Ž₈
Increasing the value of c leads to a rise in the average number of busy junior servers. Additionally, the number of junior servers in C-mode also increases with an increase in c.
An expansion in the capacity of the waiting area corresponds to a proportional increase in the number of busy servers in C-mode, as there is a rise in Ž₈.
The reduction in the number of servers in C-mode is seen when there is an increase in the service rate for the senior server. However, this relationship is reversed for junior servers.
A reduction in the rate $β$ always leads to a decrease in lead time, consequently resulting in a decrease in Ž₈.
Upon observing the effects of varying the probability p, there is a notable reduction in the waiting time of junior servers in C-mode.

The importance of the number of servers lies in its direct impact on the system’s capacity to serve customers. A higher number of servers increases the system’s capacity to process customers simultaneously, reducing waiting times and congestion. Conversely, a lower number of servers can lead to longer waiting times and potentially dissatisfied customers.

6.5. Analysis of Busy Junior servers in S-mode

This section analyzes the impact of parameters on the busy junior servers in server mode, which are displayed in Figure 3 to Figure 9. The observation of parameters are given below:

As arrivals increase, Ž₃ rises. This, in turn, raises the probability of junior servers being in S-mode.
Similarly, when the retrial rate $θ$ is raised, orbital customers have a higher chance of entering the waiting hall. Consequently, there is an uptick in the count of junior servers in S-mode.
Increasing the value of c results in a higher average of occupied junior servers. Simultaneously, there is a rise in Ž₉ with an increase in c.
Expanding the capacity of the waiting hall leads to a corresponding increase in the number of occupied servers in S-mode due to the upswing in the average number of servers in S-mode.
With an increase in the service rates for both senior and junior servers, Ž₉ decreases due to the reduction in average service time per customer.
An increase in the rate $β$ consistently leads to a reduction in lead time. Consequently, there is a decrease that can be seen in Ž₉.
An examination of the effect of varying the probability p in combination with each parameter consistently reveals a decrease in the number of junior servers in S-mode.

In service mode, the number of servers can vary based on factors such as demand patterns, time of day, or operational decisions. Having the flexibility to adjust the number of servers allows for responsiveness to changing levels of demand. Increasing the number of servers during high-demand periods can help manage waiting times and improve customer satisfaction. Conversely, reducing the number of servers during low-demand periods can help optimize resource utilization.

Figure 3. Mean busy servers in S-mode vs p and

β

Figure 3. Mean busy servers in S-mode vs p and

β

Figure 4. Mean busy servers in S-mode vs p and c.

Figure 5. Mean busy servers in S-mode vs p and

λ

Figure 5. Mean busy servers in S-mode vs p and

λ

Figure 6. Mean busy servers in S-mode vs p and

μ

Figure 6. Mean busy servers in S-mode vs p and

μ

Figure 7. Mean busy servers in S-mode vs p and

α

Figure 7. Mean busy servers in S-mode vs p and

α

Figure 8. Mean busy servers in S-mode vs p and N.

Figure 9. Mean busy servers in S-mode vs p and

θ

Figure 9. Mean busy servers in S-mode vs p and

θ

6.6. Analysis of Fraction of Successful Retrial Rate

The fraction of successful retrial rate is analyzed in this section under the parameter variation, shown in Figure 10 to Figure 16. The observations are listed below:

There is a gradual increase in Ž₁₆ while varying the parameter $β$ . However, after some point, the increase is not notably significant.
An immediate response of increasing c can be observed in Ž₁₆ as it increases.
The fraction of successful retrial rate decreases when the arrival rate of the customer increases. After some values, it moves faster towards the value zero.
An increase in the service rate directly decreases the service time per customer. It is suitable for the service rates of both junior and senior servers. As a result, they increase the rate of successful retrial.
Increasing the capacity of the waiting hall increases the chance of a retrial’s success. Hence Ž₁₆ increases when we increase N.
As similar to lambda, while increasing the rate $θ$ , the waiting hall soon becomes full, which decreases the chance of a successful retrial.

Analyzing the fraction of successful retrial rate provides valuable insights into the performance and effectiveness of a system in handling retrials. The service rates, number of servers, waiting hall size and reorder rate directly influence it.

Figure 10. Fraction of successful rate of retrial vs p and

β

Figure 10. Fraction of successful rate of retrial vs p and

β

Figure 11. Fraction of successful rate of retrial vs p and c.

Figure 12. Fraction of successful rate of retrial vs p and

λ

Figure 12. Fraction of successful rate of retrial vs p and

λ

Figure 13. Fraction of successful rate of retrial vs p and

μ

Figure 13. Fraction of successful rate of retrial vs p and

μ

Figure 14. Fraction of successful rate of retrial vs p and

α

Figure 14. Fraction of successful rate of retrial vs p and

α

Figure 15. Fraction of successful rate of retrial vs p and N.

Figure 16. Fraction of successful rate of retrial vs p and

θ

Figure 16. Fraction of successful rate of retrial vs p and

θ

6.7. Observations

We present the observations that we saw in each numerical analysis.

The obtained convexity of the total cost helps in identifying efficient configurations that minimize overall costs.
The parameters $β, μ$ and $α$ expose a favorable out put for each analysis.
Though the parameters N and c increase the total cost, they are actually helpful in increasing the fraction of successful retrial.
When $p = 0$ , the model turns to be the standard QIS without consultation.
When $p = 1$ , the model turns to be the QIS with compulsory consultation as [10]. Also, with the inventory and retrial facility, the model looks like an extension version of [10].
The rate $θ$ decreases the waiting time of customers in the orbit when it increases. But, in the case of customers in the waiting hall, it acts inversely.
The rate $λ$ increases the total cost, waiting time of customers and number of junior servers in C and S mode.
An increase in p means that the junior servers are developed as experienced servers.

7. Conclusion

In this article, we have investigated the queueing-inventory model, where junior servers occasionally encounter challenges while serving customers. When faced with such situations, they seek advice from the senior server to resolve the issue. Initially, primary customers meet junior servers to set up service. If the junior server faces no issues while providing service, a customer leaves the system successfully with an item. Suppose that the junior server faces an issue. He enters C-mode for consultation with a senior server. Following this consultation, the senior and junior servers collaborate to finalise the service. When the senior server is engaged with other junior servers, the latter joins a line and waits for their turn. Essentially, in the second phase, junior servers assume the role of customers.

To evaluate this system, a Markovian queueing-inventory model is employed, necessitating the creation of a four-dimensional state space. By applying Neuts and Rao’s truncation method, the study calculates the steady-state probability vector of the system and various performance metrics. The investigation also scrutinizes customer waiting times and the average count of active junior servers in both S-mode and C-mode. By varying the probabilities, we gain insight into the impact of the necessity for junior server consultations at the end of service, ranging from compulsory consultation to no consultation. As junior servers accumulate experience from the senior server over time, the need for consultations ultimately decreases. These analyses offer valuable insights into the model’s performance and effectiveness. In the future, this model could be extended to incorporate more complex arrival processes (MAP) and phase-type distributions, replacing the current Poisson and exponential distributions.

Author Contributions

Conceptualization, J.K. and H.T.; Software, H.T.; Investigation, L.K., (Section 1–Section 2); A.M., and J.S., (Section 3, Section 4, Section 5 and Section 6); Writing—original draft preparation, review and editing, all the authors.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

Aghsami, A., Samimi, Y., & Aghaie, A. (2023). A combined continuous-time Markov chain and queueing-inventory model for a blood transfusion network considering ABO/Rh substitution priority and unreliable screening laboratory. Expert Systems with Applications, 215, 119360.
Almaqbali, K. A., Joshua, V. C., & Krishnamoorthy, A. (2023). Multi-class, multi-server queueing inventory system with batch service. Mathematics, 11(4), 1-29.
Amirthakodi, M. and Sivakumar, B. (2019). An inventory system with service facility and feedback customers. International Journal of Industrial and Systems Engineering, 33(3):374–411.
Artalejo, J. R., Krishnamoorthy, A., & Lopez-Herrero, M. J. (2006). Numerical analysis of (s, S) inventory systems with repeated attempts. Annals of Operations Research, 141, 67-83.
Bazizi, L., Rahmoune, F., Lekadir, O., & Labadi, K. (2023). Modelling, performance evaluation and optimisation of (s,Q) retrial inventory system with partial backlogging demands: a gspn approach. European Journal of Industrial Engineering, 17(4):529–569.
Chakravarthy, S. R. (2014). A multi-server queueing model with server consultations. European Journal of Operational Research, 233(3), 625-639.
Chakravarthy, S. R., & Rumyantsev, A. (2020). Analytical and simulation studies of queueing-inventory models with MAP demands in batches and positive phase-type services. Simulation Modelling Practice and Theory, 103, 102092.
Chakravarthy, S. R., Shajin, D., & Krishnamoorthy, A. (2020). Infinite server queueing-inventory models. Journal of the Indian Society for Probability and Statistics, 21(1), 43-68.
Hanukov, G. (2022). A queueing-inventory system in which customers can orbit during the service. IFAC-PapersOnLine, 55(10):619–624. 10th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2022.
Hanukov, G. (2022). A service system where junior servers approach a senior server on behalf of customers. International Journal of Production Economics, 244, 108351.
Hanukov, G., Avinadav, T., Chernonog, T., & Yechiali, U. (2021). A multi-server system with inventory of preliminary services and stock-dependent demand. International Journal of Production Research, 59(14), 4384-4402.
Hanukov, G., Avinadav, T., Chernonog, T., & Yechiali, U. (2019). A multi-server queueing-inventory system with stock-dependent demand. IFAC-PapersOnLine, 52(13), 671-676.
Jain, M. & Kumar, I. (2023). Cost optimization of a queueing inventory system with two-level supply mode, retrial demands and multiple vacations using a genetic algorithm. International Journal of Applied and Computational Mathematics, 9(4):51.
Jeganathan, K., Koffer, V. A., Sugapriya, C., & Nagarajan, D. (2023). A matrix-analytic method for the steady-state analysis of a Markovian queueing system with scrap items. Decision Analytics Journal, 7, 1-20.
Jeganathan, K., Reiyas, M. A., Lakshmi, K. P., & Saravanan, S. (2019). Two server Markovian inventory systems with server interruptions: Heterogeneous vs. homogeneous servers. Mathematics and Computers in Simulation, 155, 177-200.
Jeganathan, K., & Reiyas, M. A. (2020). Two parallel heterogeneous servers Markovian inventory system with modified and delayed working vacations. Mathematics and Computers in Simulation, 172, 273-304.
Jeganathan, K., Harikrishnan, T., Selvakumar, S., Anbazhagan, N., Amutha, S., Acharya, S., Rajendra, D., & Joshi, G. P. (2021). Analysis of interconnected arrivals on queueing-inventory system with two multi-server service channels and one retrial facility. Electronics, 10(5), 1-35.
Jeganathan, K., Selvakumar, S., Saravanan, S., Anbazhagan, N., Amutha, S., Cho, W., Joshi, G. P., & Ryoo, J. (2022). Performance of stochastic inventory system with a fresh item, returned item, refurbished item, and multi-class customers. Mathematics, 10(7), 1-37.
Jeganathan, K., Harikrishnan, T., Prasanna Lakshmi, K., and Nagarajan, D. (2023). A multi-server retrial queueing-inventory system with asynchronous multiple vacations. Decision Analytics Journal, 9, 1-19.
Jose, K. P., & Beena, P. (2020). On a retrial production inventory system with vacation and multiple servers. International Journal of Applied and Computational Mathematics, 6(4), 1-17.
Krishnamoorthy, A., Manikandan, R., & Shajin, D. (2015). Analysis of a multiserver queueing-inventory system. Advances in Operations Research, 2015, 1-16.
Lopez-Herrero and Jesus, M. (2010). Waiting time and other first-passage time measures in an (s, S) inventory system with repeated attempts and finite retrial group. Computers and operations research, 37(7):1256–1261.
Melikov, A., Aliyeva, S., Nair, S. S., and Kumar, B. K. (2022). Retrial queuing-inventory systems with delayed feedback and instantaneous damaging of items. Axioms, 11:241.
Melikov, A. Z., & Molchanov, A. A. (1992). Stock optimization in transportation/storage systems. Cybernetics and Systems Analysis, 28(3), 484-487.
Nair, A. N., Jacob, M. J., & Krishnamoorthy, A. (2015). The multi server M/M/(s, S) queueing inventory system. Annals of Operations Research, 233, 321-333.
Neuts, M. F. (1994). Matrix-geometric solutions in stochastic models: an algorithmic approach. Courier Corporation.
Neuts, M. F., & Rao, B. M. (1990). Numerical investigation of a multiserver retrial model. Queueing systems, 7, 169-189.
Nithya, N., Anbazhagan, N., Amutha, S., Jeganathan, K., Park, G.-C., Joshi, G. P., and Cho, W. (2023). Controlled arrivals on the retrial queueing–inventory system with an essential interruption and emergency vacationing server. Mathematics, 11(16):3560.
Rasmi, K., & Jacob, M. J. (2021). Analysis of a multiserver queueing inventory model with self-service. International Journal of Mathematical Modelling and Numerical Optimisation, 11(3), 275-291.
Rasmi, K., Jacob, M. J., Rumyantsev, A. S., & Krishnamoorthy, A. (2021). A multi-server heterogeneous queuing-inventory system with class-dependent inventory access. Mathematics, 9(9), 1-23.
Reiyas, M. A. & Jeganathan, K. (2023). A classical retrial queueing inventory system with two component demand rate. International Journal of Operational Research, 47(4):508–533.
Selvakumar, S., Jeganathan, K., Srinivasan, K., Anbazhagan, N., Lee, S., Joshi, G. P., & Doo, I. C. (2023). An optimization of home delivery services in a stochastic modeling with self and compulsory vacation interruption. Mathematics, 11(9), 1-34.
Shajin, D., Krishnamoorthy, A., Melikov, A. Z., & Sztrik, J. (2022). Multi-server queuing production inventory system with emergency replenishment. Mathematics, 10(20), 1-24.
Sigman, K., & Simchi-Levi, D. (1992). Light traffic heuristic for an M/G/1 queue with limited inventory. Annals of Operations Research, 40, 371–380.
Sugapriya, C., Nithya, M., Jeganathan, K., Anbazhagan, N., Joshi, G. P., Yang, E., & Seo, S. (2022). Analysis of stock-dependent arrival process in a retrial stochastic inventory system with server vacation. Processes, 10(1):176.
Suganya, C., & Sivakumar, B. (2019). MAP/PH (1), PH (2)/2 finite retrial inventory system with service facility, multiple vacations for servers. International Journal of Mathematics in Operational Research, 15(3), 265-295.
Ushakumari, P. V. (2007). On (s, S) inventory system with random lead time and repeated demands. Journal of Applied Mathematics and Stochastic Analysis, 2006.
Wang, F. F. (2015). Approximation and optimization of a multi-server impatient retrial inventory-queueing system with two demand classes. Quality Technology and Quantitative Management, 12(3), 269-292.
Wang, F. F., Bhagat, A., & Chang, T. M. (2017). Analysis of priority multi-server retrial queueing inventory systems with MAP arrivals and exponential services. Opsearch, 54, 44-66.
Yadavalli, V. S., Sivakumar, B., Arivarignan, G., & Adetunji, O. (2011). A multi-server perishable inventory system with negative customer. Computers and Industrial Engineering, 61(2), 254-273.
Yadavalli, V. S., Sivakumar, B., Arivarignan, G., & Adetunji, O. (2012). A finite source multi-server inventory system with service facility. Computers and Industrial Engineering, 63(4), 739-753.
Yue, D., Ye, Z., & Yue, W. (2023). Analysis of a Queueing-Inventory System with Synchronous Vacation of Multiple Servers. Queueing Models and Service Management, 6(1), 1-26.

Figure 1. Model flow chart.

Figure 2. Expected total cost for S vs s

Table 10. Ž₈ vs

N, μ, α

and p

Table 10. Ž₈ vs

N, μ, α

and p

N	$μ$	$α$	p	0.25	0.50	0.75	1.00
5	2	7	0.214168	0.173785	0.153179	0.140672	0.132265
		8	0.205232	0.165357	0.144930	0.132515	0.124167
		9	0.197841	0.158327	0.138030	0.125685	0.117382
	3	7	0.311016	0.243614	0.208336	0.186755	0.172203
		8	0.300123	0.233510	0.198503	0.177056	0.162586
		9	0.291243	0.225200	0.190392	0.169047	0.154639
	4	7	0.548656	0.420817	0.348025	0.302173	0.270858
		8	0.534660	0.408228	0.335948	0.290339	0.259165
		9	0.523450	0.398053	0.326153	0.280728	0.249662
6	2	7	0.214574	0.173874	0.153211	0.140687	0.132273
		8	0.205650	0.165451	0.144964	0.132532	0.124176
		9	0.198264	0.158424	0.138066	0.125702	0.117391
	3	7	0.312723	0.243974	0.208462	0.186813	0.172234
		8	0.301814	0.233874	0.198631	0.177115	0.162617
		9	0.292917	0.225563	0.190521	0.169106	0.154671
	4	7	0.560953	0.423295	0.348857	0.302539	0.271048
		8	0.546575	0.410671	0.336772	0.290703	0.259353
		9	0.535072	0.400464	0.326969	0.281088	0.249849
7	2	7	0.215571	0.174074	0.153276	0.140714	0.132287
		8	0.206497	0.165628	0.145023	0.132557	0.124189
		9	0.199010	0.158583	0.138120	0.125726	0.117403
	3	7	0.315726	0.244621	0.208679	0.186906	0.172281
		8	0.304383	0.234445	0.198826	0.177200	0.162661
		9	0.295190	0.226081	0.190700	0.169185	0.154712
	4	7	0.571828	0.426441	0.349984	0.303037	0.271302
		8	0.555640	0.413467	0.337792	0.291157	0.259587
		9	0.542875	0.403013	0.327913	0.281511	0.250067

Table 11. Ž₈ vs

λ, θ,

and p

Table 11. Ž₈ vs

λ, θ,

and p

$λ$	$θ$	p	0.25	0.50	0.75	1.00
1	0.7	0.298673	0.230565	0.195358	0.173921	0.159507
	0.9	0.301814	0.233874	0.198631	0.177115	0.162617
	1.1	0.302669	0.234794	0.199552	0.178019	0.163501
1.5	0.7	0.391362	0.295437	0.244605	0.213324	0.192213
	0.9	0.395540	0.300339	0.249639	0.218302	0.197071
	1.1	0.396814	0.301838	0.251218	0.219896	0.198652
2	0.7	0.484258	0.357994	0.293037	0.252562	0.225074
	0.9	0.487276	0.363284	0.298753	0.258276	0.230623
	1.1	0.488741	0.365234	0.300915	0.260522	0.232891

Table 12. Ž₈ vs

c, β

and p

Table 12. Ž₈ vs

c, β

and p

c	$β$	p	0.25	0.50	0.75	1.00
2	1	0.200141	0.149298	0.123846	0.108641	0.098556
	2	0.200125	0.149298	0.123846	0.108641	0.098556
	3	0.200117	0.149297	0.123845	0.108640	0.098555
3	1	0.301820	0.233874	0.198631	0.177115	0.162617
	2	0.301810	0.233873	0.198630	0.177114	0.162616
	3	0.301818	0.233872	0.198629	0.177113	0.162615
4	1	0.315977	0.249250	0.212910	0.189968	0.174199
	2	0.315622	0.249228	0.212908	0.189967	0.174199
	3	0.315402	0.249212	0.212905	0.189966	0.174198

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

MDPI Initiatives

Important Links

Choose an area of interest and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

Modeling of Junior Servers Approaching a Senior Server in the Retrial Queueing-Inventory System

Abstract

1. Introduction

1.1. Motivation

1.2. Literature Review

1.3. Research Gap

1.4. Novelty and Contribution of the Model

2. Model Description

2.1. Notations

2.2. Model Formulation

3. Mathematical Analysis

3.1. Neuts and Rao Matrix Geometric Approximation

3.2. Limiting Probability Distribution

4. Computation of R Matrix

5. System Performance Measures

5.1. The Expected Total Cost

6. Cost Analysis and Numerical Illustration

6.1. Analysis on the Expected Total Cost

6.2. Analysis on Mean Waiting Time of Customers in the Waiting Hall

6.3. Analysis of Mean Waiting Time for Customer in the Orbit

6.4. Analysis on Mean Waiting Time of Junior Servers in C-Mode

6.5. Analysis of Busy Junior servers in S-mode

6.6. Analysis of Fraction of Successful Retrial Rate

6.7. Observations

7. Conclusion

Author Contributions

Funding

Conflicts of Interest

References

MDPI Initiatives

Important Links

Subscribe

4. Computation of $R$ Matrix