I a recent paper we introduced the queue-and-idleness ratio (QIR) family of routing rules for many-server service systems with multiple customer classes and server pools. A newly available server serves the customer from the head of the queue of the class (from among those the server is eligible to serve) whose queue length most exceeds a specified proportion of the total queue length. Under fa...

ABSTRACT We analyze a single server queue with modified Bernoulli server vacations based on exhaustive service. Unlike other vacation policies, we assume that only at the completion of service of the last customer in the system, the server has the option to take a vacation or to remain idle in the system waiting for the next customer to arrive. The service times of the customers have been assum...

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...

A major cause for concern in hospitals is congestion, which brings about untoward hardship to patients due long queues and delay service delivery. This paper seeks minimize the waiting time of by comparing performance indicators a single server multi-server model at Paediatrics Department Muhammad Abdullahi Wase Specialist Hospital Kano (MAWSHK). In order achieve this, primary data was obtained...

We analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind) gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoul...

In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously sw...

We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number N of customers cycles through this network. We determine the joint sojourn time distribution of a tagged customer in, first, the general queue and, then, the exponential queue. Subsequently, we indicate how th...

This paper presents an analysis of a cyclic-service tandem queue (M/C/l type queue) with exhaustive services and multiple server vacations, in which a single server takes repeated vacations until it finds at least one message in the first queue after emptying the queueing system. It is assumed that the vacation time is generally distributed, and switch-over times are zero. This paper analyzes q...

In this paper we propose a highly accurate approximate performance analysis of a heterogeneous server system with a processor sharing (PS) service discipline and a general job-size distribution under a generalized join the shortest queue (GJSQ) routing protocol. The GJSQ routing protocol is a natural extension of the well-known join the shortest queue (JSQ) routing policy that takes into accoun...

In this paper, we consider a single-server queue with stationary input, where each job joining the queue has an associated deadline. The deadline is a time constraint on job sojourn time and may be finite or infinite. If the job does not complete service before its deadline expires, it abandons the queue and the partial service it may have received up to that point is wasted. When the queue ope...