We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.

We study the Round-Robin (RR) routing to a system of parallel queues, which serve jobs according to FCFS or preemptive LCFS scheduling disciplines. The cost structure comprises two components: a service fee and a queueing delay related component. With Poisson arrivals, the inter-arrival time to each queue obeys the Erlang distribution. This allows us to study the mean and transient behavior of ...

This paper deals with machine repair problem with balking and reneging. There is provision of mixed standby (warm and cold) components to replace the failed machines. The lifetime and repair time are assumed to have exponential distribution. Birth-death technique is suggested to obtain the queue size distribution in explicit form. A repair facility of C permanent repairmen is facilitated to rep...

The paper allocates a stochastic model on threesimilar units three-phased mission system. developed system consists of working in parallel, series and parallel configurations respectively. Initially, the three similar are operational. Each component has only states: good, degraded failed. In this case, single repair facility that repairs first come serve (FCFS)pattern been thought of. Using Sem...

This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy ...