Abstract: The present investigation deals with M/G/1 retrial queue with unreliable server and general retrial times. The server is subject to breakdowns and takes some setup time before starting the repair. The server renders first essential phase of service (FES) to all the arriving customers whereas second optional phase services (SOS) are provided after FES to only those customers who opt fo...

In this paper, we consider a discrete-time single-server finite-buffer batch arrival queue in which customers are served in batches according to a general bulk-service rule, that is, at least ‘a’ customers are needed to start a service with a maximum serving capacity of ‘b’ customers. The server takes a (single and multiple) vacation as soon as the queue length falls below ‘a’ at the completion...

In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in c...

Resequencing issue is a crucial issue in simultaneous processing systems where the order of customers (jobs, units) upon arrival has to be preserved upon departure. In this paper stationary characteristics of M/M/3/∞ queueing system with reordering buffer of infinite capacity are being analyzed. Noticing that customer in reordering buffer may form two separate queues, focus is given to the stud...

Here, a two server queueing system with Poisson arrivals and two different types of customers (M/H2/2 queue) is analyzed. A novel straightforward method is presented to acquire the exact and explicit forms of the performance measures. First, the steady state equations along with their Z-transforms are derived for the aforementioned queueing system. Using some limiting behaviors of the steady-st...

We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced to that of a single server queue. We present a complete solution to the waiting-time distribution of D-MAP/D/k queue together with some computa...