In this paper we examine a tandem network of queueing nodes where a nonstationary external Markovian arrival process feeds the initial upstream node. We develop methods for modeling the departure flow from any upstream node in its role as the arrival process to the immediate downstream node, and employ various techniques to match the interarrival moments to the downstream node to the moments of...

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formulas are derived for the j-th moments (j ∈ N) of the (conditional) stationary sojourn time in the M/G/1—EPS queue with K (K ∈ 0 ∪ N) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

We study a network of fluid queues in which exogenous arrivals are modulated by a continuous-timeMarkov chain. Service rates in each queue are proportional to the queue size, and the network is assumed to be irreducible. Thequeue levels satisfy a linear, vectorvalued differential equation. We obtain joint moments of the queue sizes recursively, and deduce the Laplace transform of the queue size...

this paper analyzes a renewal input  working vacations queue with change over times and bernoulli schedulevacation interruption under (a,c,b) policy.the service and vacation times are exponentially distributed.the server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

in this paper, we study the network location problem for two congestible facilities, considering impatient customers. we suppose that when a customer arrives his/her corresponding facility and faces a queue with the size more than a predetermined threshold, the customer decides not to join the queue but to go to the closest facility to current facility. in the second facility, if the queue size...

This paper deals with the G/G/R machining system consisting of M operating machines as well as S cold standbys. The concepts of balking and reneging are incorporated which make our model more versatile to deal with real time systems. The broken-down machines are sent to repair facilities consisting of R permanent repairmen. The failure times and repair times are generally identical and independ...