A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been det...

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...

This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical  computations in the form of graphs are presented to show the par...

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

This paper studies a batch arrival single server Bernoulli feedback queue with Poisson arrivals, two stages of heterogeneous service with different (arbitrary) service time distributions subject to random breakdowns and multiple vacations with exponential distributed with Mean vacation time . After first-stage service the server must provide the second stage service. However after the completio...

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time di...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

We prove asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a single constant service rate server queue shared by multiple sessions with the generalized processor sharing (GPS) scheduling discipline. The special case of a two-queue GPS system has been dealt with separately in Part I of the paper [33], where exact bounds are obtained...