Document Type
Article
Publication Date
1-26-2023
Publication Title
Mathematics
Abstract
In this paper, we consider a single server queueing system in which the arrivals occur according to a Markovian arrival process (MAP). The served customers may be recruited (or opted from those customers’ point of view) to act as secondary servers to provide services to the waiting customers. Such customers who are recruited to be servers are referred to as secondary servers. The service times of the main as well as that of the secondary servers are assumed to be exponentially distributed possibly with different parameters. Assuming that at most there can only be one secondary server at any given time and that the secondary server will leave after serving its assigned group of customers, the model is studied as a QBD-type queue. However, one can also study this model as a G I/M/1-type queue. The model is analyzed in steady state, and a few illustrative numerical examples are presented.
Volume
11
Issue
624
First Page
1
Last Page
24
DOI
10.3390/math11030624
ISSN
EISSN 2227-7390
Rights
Copyright: © 2023 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/).
Recommended Citation
Chakravarthy, Srinivas; Dudin, Alexander N.; Dudin, Sergey A.; and Dudina, Olga S., "Queueing System with Potential for Recruiting Secondary Servers" (2023). Industrial & Manufacturing Engineering Publications. 136.
https://digitalcommons.kettering.edu/industrialmanuf_eng_facultypubs/136