In this paper, we investigate the fuzzy logic based system characteristics of M/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have cho...

The M/C/1 queue with multiple vacations and gated service discipline is considered. We first provide an alternative approach to derive the Laplace-Stieltjes transform of the limiting waiting time distribution, which reveals the stochastic structure of the gated vacation system. Next we discuss the regenerative cycle of the gated vacation system. Based on these considerations, we carry our a tim...

In this paper, we analyze a bulk input Geom/Geom/1 queue with single working vacation. Using the matrix analysis method, highly complicated PGF of the stationary queue size is firstly derived, from which we got the stochastic decomposition result for the PGF of the stationary queue size. It is important that we find the biparameter addition theorems of the conditional negative binomial distribu...

Non-preemptive priority queue system is a type of where customers with higher priorities cannot interrupt low one while being served. High consumers will still be at the head queue. This article discusses non-preemptive multiple working vacations, vacation can interrupted. Customers are classified into two classes, namely class I (non-preemptive customers) and II, exponentially distributed serv...

In this paper we study a multi-server queue with single Vacation (e,d)policy using DSW (Dong, Shah, Wong) algorithm. Vacation rate is fuzzy number. Approximate method of extension namely DSW algorithm is used to define membership functions of the performance measures. It is based on the αcut representation of fuzzy sets in a standard interval analysis. Numerical example is given to test the fea...

Consider an M/M/1 queueing system with server vacations where the server is turned oo as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding co...