This paper considers a stationary single-server queue with multiple arrival streams governed by a Markov chain, where customers are served on an LCFS preemptive-resume basis. Service times of customers from each arrival stream are generally distributed and service time distributions for different arrival streams may be different. Under these assumptions, it is shown that the stationary distribu...

We establish functional large deviation principles (FLDPs) for waiting and departure processes in single-server queues with unlimited waiting space and the rst-in rst-out service discipline. We apply the extended contraction principle to show that these processes obey FLDPs in the function space D with one of the non-uniform Skorohod topologies whenever the arrival and service processes obey FL...

Motivated by telephone call centers, we study large-scale service systems with multiple customer classes and multiple agent pools, each with many agents. For the purpose of delicately balancing service levels of the different customer classes, we propose a family of routing controls called Fixed-QueueRatio (FQR) rules. A newly available agent next serves the customer from the head of the queue ...

Consider a single server queue with unit service rate fed by an arrival process of the following form: sessions arrive at the times of a Poisson process of rate λ, with each session lasting for an independent integer time τ > 1, where P (τ = k) = pk with pk ∼ αk−(1+α)L(k), where 1 < α < 2 and L(·) is a slowly varying function. Each session brings in work at unit rate while it is active. Thus th...

This paper presents a decision making approach for mid-term scheduling of large industrial consumers based on the recently introduced class of Stochastic Dominance (SD)- constrained stochastic programming. In this study, the electricity price in the pool as well as the rate of availability (unavailability) of the generating unit (forced outage rate) is considered as uncertain parameters. Th...

Today no body interested to wait for food in restaurant. Some restaurants initially provide more waiting chairs for customers However, waiting chairs alone would not solve a problem, and the service time may need to be improved. This shows a need of a numerical model for the restaurant management to understand the situation better. This paper aims that, using queuing theory satisfies the model ...

We consider a finite buffered queue in which the queue length is controlled by dynamically selecting between two possible service rates (low and high). Using the faster service rate requires higher operating costs which may justify using the slower rate from time to time. Moreover, the system incurs holding costs for customers waiting to be processed and setup costs for each service rate change...

In this paper we consider a Jackson network of independent service stations. To improve upon the total expected waiting time, the stations may redistribute the total arrival rate of customers over all queues. We investigate this situation by means of arrival rate games. These are cooperative TU cost games in which the stations are the players and the total cost of a coalition is linear in the t...