scholarly journals Analysis of an M/M/cQueueing System with Impatient Customers and Synchronous Vacations

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Dequan Yue ◽  
Wuyi Yue ◽  
Guoxi Zhao
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Function Method ◽  
Queueing System ◽  
Probability Generating Function ◽  
Impatient Customers ◽  
Balance Equations ◽  
Limiting Behavior ◽  
Special Cases ◽  
Steady State Probabilities

We consider an M/M/cqueueing system with impatient customers and a synchronous vacation policy, where customer impatience is due to the servers’ vacation. Whenever a system becomes empty, all the servers take a vacation. If the system is still empty, when the vacation ends, all the servers take another vacation; otherwise, they return to serve the queue. We develop the balance equations for the steady-state probabilities and solve the equations by using the probability generating function method. We obtain explicit expressions of some important performance measures by means of the two indexes. Based on these, we obtain some results about limiting behavior for some performance measures. We derive closed-form expressions of some important performance measures for two special cases. Finally, some numerical results are also presented.

scholarly journals On a bulk queueing system with impatient customers

1998 ◽  
Vol 3 (6) ◽  
pp. 539-554 ◽  
Author(s):  
Lotfi Tadj ◽  
Lakdere Benkherouf ◽  
Lakhdar Aggoun
Keyword(s):  
Steady State ◽  
Queue Length ◽  
Queueing System ◽  
Impatient Customers ◽  
Ergodicity Condition ◽  
Bulk Service ◽  
Bulk Arrival ◽  
Steady State Probabilities ◽  
System Characteristics

We consider a bulk arrival, bulk service queueing system. Customers are served in batches ofrunits if the queue length is not less thanr. Otherwise, the server delays the service until the number of units in the queue reaches or exceeds levelr. We assume that unserved customers may get impatient and leave the system. An ergodicity condition and steady-state probabilities are derived. Various system characteristics are also computed.

scholarly journals M/M/1 Queueing system with Customer Balking and Reneging

2019 ◽  
Vol 8 (9) ◽  
pp. 2636-2646
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Generating Functions ◽  
Queueing System ◽  
Probability Generating Functions ◽  
Multiple Vacation ◽  
Steady State Probabilities ◽  
Explicit Expressions

This paper deals with an M/M/1 queueing system with customer balking and reneging. Balking and reneging of the customers are assumed to occur due to non-availability of the server during vacation and breakdown periods. Steady state probabilities for both the single and multiple vacation scenarios are obtained by employing probability generating functions. We evaluate the explicit expressions for various performance measures of the queueing system.

scholarly journals Computational Analysis of Queues with Catastrophes in a Multiphase Random Environment

2016 ◽  
Vol 2016 ◽  
pp. 1-7
Author(s):  
G. Arul Freeda Vinodhini ◽  
V. Vidhya
Keyword(s):  
Performance Measures ◽  
Computational Analysis ◽  
Road Traffic ◽  
Probability Generating Function ◽  
Weather Conditions ◽  
Traffic Model ◽  
Matrix Geometric Method ◽  
Special Cases ◽  
Full Capacity ◽  
Steady State Probabilities

A dynamically changing road traffic model which occasionally suffers a disaster (traffic collision, wrecked vehicles, conflicting weather conditions, spilled cargo, and hazardous matter) resulting in loss of all the vehicles (diverted to other routes) has been discussed. Once the system gets repaired, it undergoesn-1trial phases and finally reaches its full capacity phasen. We have obtained the explicit steady state probabilities of the system via Matrix Geometric Method. Probability Generating Function is used to evaluate the time spent by the system in each phase. Various performance measures like mean traffic, average waiting time of vehicles, and fraction of vehicles lost are calculated. Some special cases have also been discussed.

scholarly journals The M/M/NRepairable Queueing System with Variable Breakdown Rates

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Shengli Lv ◽  
Jingbo Li
Keyword(s):  
Steady State ◽  
Queueing System ◽  
Probability Generating Function ◽  
Idle Time ◽  
Transform Method ◽  
Busy Time ◽  
Breakdown Rates ◽  
The Mean ◽  
System States ◽  
Steady State Probabilities

This paper considers the M/M/Nrepairable queuing system. The customers' arrival is a Poisson process. The servers are subject to breakdown according to Poisson processes with different rates in idle time and busy time, respectively. The breakdown servers are repaired by repairmen, and the repair time is an exponential distribution. Using probability generating function and transform method, we obtain the steady-state probabilities of the system states, the steady-state availability of the servers, and the mean queueing length of the model.

scholarly journals Performance and economic analysis of Markovian Bernoulli feedback queueing system with vacations, waiting server and impatient customers

2018 ◽  
Vol 10 (2) ◽  
pp. 218-241
Author(s):  
Amina Angelika Bouchentouf ◽  
Abdelhak Guendouzi ◽  
Abdeldjebbar Kandouci
Keyword(s):  
Queueing System ◽  
Numerical Study ◽  
Cost Model ◽  
Probability Generating Function ◽  
Impatient Customers ◽  
Bernoulli Feedback ◽  
Single Vacation ◽  
Impatient Customer ◽  
Steady State Probabilities ◽  
Random Amount

Abstract This paper concerns the analysis of a Markovian queueing system with Bernoulli feedback, single vacation, waiting server and impatient customers. We suppose that whenever the system is empty the sever waits for a random amount of time before he leaves for a vacation. Moreover, the customer’s impatience timer depends on the states of the server. If the customer’s service has not been completed before the impatience timer expires, the customer leaves the system, and via certain mechanism, impatient customer may be retained in the system. We obtain explicit expressions for the steady-state probabilities of the queueing model, using the probability generating function (PGF). Further, we obtain some important performance measures of the system and formulate a cost model. Finally, an extensive numerical study is illustrated.

A single server Markovian queuing system with limited buffer and reverse balking

2021 ◽  
Vol 12 (7) ◽  
pp. 1774-1784
Author(s):  
Girin Saikia ◽  
Amit Choudhury
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Mutual Fund ◽  
System Size ◽  
Queuing System ◽  
Single Server ◽  
Insurance Company ◽  
Number Of Customers ◽  
Steady State Probabilities

The phenomena are balking can be said to have been observed when a customer who has arrived into queuing system decides not to join it. Reverse balking is a particular type of balking wherein the probability that a customer will balk goes down as the system size goes up and vice versa. Such behavior can be observed in investment firms (insurance company, Mutual Fund Company, banks etc.). As the number of customers in the firm goes up, it creates trust among potential investors. Fewer customers would like to balk as the number of customers goes up. In this paper, we develop an M/M/1/k queuing system with reverse balking. The steady-state probabilities of the model are obtained and closed forms of expression of a number of performance measures are derived.

scholarly journals The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

2008 ◽  
Vol 18 (1) ◽  
pp. 23-36 ◽  
Author(s):  
A.I. Shawky ◽  
M.S. El-Paoumy
Keyword(s):  
Steady State ◽  
Analytical Solution ◽  
Explicit Form ◽  
Recurrence Relations ◽  
Expected Number ◽  
Special Cases ◽  
Queue Discipline ◽  
Bulk Service ◽  
General Bulk Service Rule ◽  
Steady State Probabilities

The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I) units arrive according to a hyper-Poisson distribution with k independent branches, (II) the queue discipline is FIFO; and (III) the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

A Novel Approach for Analyzing Single Buffer Queueing Systems with State-Dependent Vacation and Correlated Input Process under Four Different Service Disciplines

2015 ◽  
Vol 6 (3) ◽  
pp. 19-59 ◽  
Author(s):  
Thomas Yew Sing Lee
Keyword(s):  
Performance Measures ◽  
Probability Generating Function ◽  
Performance Measure ◽  
Idle Time ◽  
Separate Analysis ◽  
Input Process ◽  
State Dependent ◽  
Special Cases ◽  
Service Disciplines ◽  
Different Types

The author presents performance analysis of a single buffer multiple-queue system. Four different types of service disciplines (i.e., non-preemptive, pre-emptive repeat different, state dependent random polling and globally gated) are analyzed. His model includes correlated input process and three different types of non-productive time (i.e., switchover, vacation and idle time). Special cases of the model includes server with mixed multiple and single vacations, stopping server with delayed vacation and stopping server with alternating vacation and idle time. For each of the four service disciplines the key performance measures such as average customer waiting time, loss probability, and throughput are computed. The results permit a detailed discussion of how these performance measures depends on the customer arrival rate, the customer service time, the switchover time, the vacation time, and the idle time. Moreover, extensive numerical results are presented and the four service disciplines are compared with respect to the performance measure. Previous studies of the single buffer multiple-queue systems tend to provide separate analysis for the two cases of zero and nonzero switchover time. The author is able to provide a unified analysis for the two cases. His results generalize and improve a number of known results on single buffer multiple-queue systems. Furthermore, this method does not require differentiation while it is needed if one uses the probability generating function approach. Lastly, the author's approach works for all single buffer multiple-queue systems in which the next queue to be served is determines solely on the basis of the occupancy states at the end of the cycle time.

Transient and steady-state analysis of a queuing system having customers’ impatience with threshold

2019 ◽  
Vol 53 (5) ◽  
pp. 1861-1876 ◽  
Author(s):  
Sapana Sharma ◽  
Rakesh Kumar ◽  
Sherif Ibrahim Ammar
Keyword(s):  
Steady State ◽  
Probability Generating Function ◽  
Threshold Value ◽  
Steady State Solution ◽  
Function Technique ◽  
Single Server ◽  
Queuing Model ◽  
Queuing Models ◽  
Special Cases ◽  
Number Of Customers

In many practical queuing situations reneging and balking can only occur if the number of customers in the system is greater than a certain threshold value. Therefore, in this paper we study a single server Markovian queuing model having customers’ impatience (balking and reneging) with threshold, and retention of reneging customers. The transient analysis of the model is performed by using probability generating function technique. The expressions for the mean and variance of the number of customers in the system are obtained and a numerical example is also provided. Further the steady-state solution of the model is obtained. Finally, some important queuing models are derived as the special cases of this model.

Sign in / Sign up

Export Citation Format

Share Document