In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

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‎.

An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...

Abstract Efficient and economical production in shale reservoirs requires specific knowledge techniques to characterize the fracture network, which consists of both large hydraulic fractures natural fractures. Current research mainly focuses on part, while characterizing is relatively rare due complexity uncertainties distribution reservoirs. This paper proposed a numerical method for this comp...