Analysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customers

Kim, Che Soong; Dudin, Alexander; Dudina, Olga; Klimenok, Valentina

doi:10.1007/s11009-019-09707-7

Cited by 5 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consideration of the model analyzed in this paper was originated during the implementation of applied research to optimize the work of the inter-banking processing center of the Republic of Belarus, which handles all money transactions between the banks. The results of analysis of a similar queueing model have recently been reported in [13]. That paper presents the motivation to consider these types of queueing system, their practical importance, the state-of-the-art, and the relevant literature.…”

Section: Introductionmentioning

confidence: 96%

“…That paper presents the motivation to consider these types of queueing system, their practical importance, the state-of-the-art, and the relevant literature. The principal difference between the models under study in [13] and in this paper is the following: in the model considered in [13], it was assumed that the customers are impatient. This means that any customer waiting in the queue departs from the system without service after a random amount of time.…”

Section: Introductionmentioning

confidence: 99%

“…The server can be in three states: r = 0 if the server has a vacation; the state r = 1 corresponds to the case when the server is busy and the maximum server attendance time is not finished; and r = 2 if the server is also busy but the maximum server attendance time is expired. It is assumed in [13] that α r > 0 for at least one of the values of r, r = 0, 1, 2.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption

Dudin

Klimenok

et al. 2021

Mathematics

Self Cite

View full text Add to dashboard Cite

We consider a MAP/PH/1-type queueing system with server vacations as a model that is useful for the analysis of multiple access systems with polling discipline without transmission interruption. Vacation of the server corresponds to the service providing competitive information flows to the polling system. In this paper, we consider a vacation queueing model under pretty general assumptions about the probabilistic distributions describing the behavior of the system and the realistic assumption, in many real-world systems, that ongoing service cannot be terminated ahead of schedule. We derive the criterion of the stable operation of the system and the stationary distributions of the system states and the waiting time. An illustrative numerical example is presented.

show abstract

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption

Dudin

Klimenok

et al. 2021

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…The existing literature about queuing systems with server vacation is also huge. We can mention, e.g., [11][12][13][14][15][16]; however, it is worth noting that the research of queuing systems with vacations mainly focuses on the analysis of single-server queues, e.g., [17]. • Systems with randomly varying number of available servers as the partial case of queues operating in the random environment, see, e.g., [18,19] and references therein.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Multi-Server Queue with Self-Sustained Servers

et al. 2021

Self Cite

View full text Add to dashboard Cite

A novel multi-server vacation queuing model is considered. The distinguishing feature of the model, compared to the standard queues, is the self-sufficiency of servers. A server can terminate service and go on vacation independently of the system manager and the overall situation in the system. The system manager can make decisions whether to allow the server to start work after vacation completion and when to try returning some server from a vacation to process customers. The arrival flow is defined by a general batch Markov arrival process. The problem of optimal choice of the total number of servers and the thresholds defining decisions of the manager arises. To solve this problem, the behavior of the system is described by the three-dimensional Markov chain with the special block structure of the generator. Conditions for the ergodicity of this chain are derived, the problem of computation of the steady-state distribution of the chain is discussed. Expressions for the key performance indicators of the system in terms of the distribution of the chain states are derived. An illustrative numerical result is presented.

show abstract

“…Impatience of the customers is a natural phenomenon and an interesting topic in queueing theory. The process of reneging and balking is extensively studied by many researchers, for example in [1][2][3][4][5][6][7][8][9][10]13,14,20,24]. Whenever an arriving customer decides not to enter the system, which is called balking while in reneging a customer in the system after waiting for some time leaves the system without being served.…”

Section: Introductionmentioning

confidence: 99%

Some Special Features of Finite-Source Retrial Queues with Collisions, an Unreliable Server and Impatient Customers in the Orbit

Sztrik

Tóth

2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

View full text Add to dashboard Cite

The goal of the paper is to study a finite-source retrial queuing system with collisions and customers' impatience behavior in the orbit. The situation when an incoming customer from the orbit or from the source finds the server busy causes a collision and both requests are directed toward the orbit. It is assumed that every request in the source is eligible to generate customers whenever the server is failed but these requests immediately go into orbit. A customer after some waiting in the orbit can depart without fulfilling its service requirement these are the socalled impatient/reneging/abandoned customers. In that case it returns to the source. A customer who is under service when the server fails is also sent to the orbit. The source, service, retrial, impatience, operation and repair times are supposed to be independent of each other. The novelty of the investigation is to carry out a sensitivity analysis comparing various distributions of impatience time of customers on the performance measures such as mean number of customers in the orbit, mean waiting time of an arbitrary, successfully served and reneging customers, probability of abandonment, server utilization, etc.

show abstract

Analysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customers

Cited by 5 publications

References 24 publications

Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption

Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption

Analysis of Multi-Server Queue with Self-Sustained Servers

Some Special Features of Finite-Source Retrial Queues with Collisions, an Unreliable Server and Impatient Customers in the Orbit

Contact Info

Product

Resources

About