We study a multi-class queue with a “learning” server who becomes stochastically faster with each subsequent customer served of the same type in a row, and returns to some baseline speed each time he switches to a different type of customer. We show under some conditions that customer waiting time is larger (in the increasing convex ordering sense) with server learning than in a queue with iid ...

This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...

This paper deals with a Markovian queueing system having a multi-task service counters and finite queue in front of each counter. The total service of a customer is completed in three stages provided by two servers at three counters. The first server (S1) can serve the counter I and III alternatively, whereas second server (S2) provides the service at counter II. The server (S1) g ives the prio...

This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed access to the server. We first present the necessary and sufficient c...