A key input to the call center staffing process is a forecast for the number of calls arriving. Density forecasts of arrival rates are needed for analytical call center models, which assume Poisson arrivals with a stochastic arrival rate. Density forecasts of call volumes can be used in simulation models, and are also important for the analysis of outsourcing contracts. A forecasting method, th...

<p style='text-indent:20px;'>In this paper, a queuing system as multi server queue, in which customers have deadline and they request service from random number of identical severs, is considered. Indeed there are stochastic jumps, the time intervals between successive jumps independent exponentially distributed. These will be occurred due to new arrival or situation change servers. There...

The loss probability in queueing systems is a very useful metric in the design and analysis of high-speed communication networks. In this paper, we investigate the convexity properties of this metric for the nite-buuer, single server M=M=1=K queue. We demonstrate that the loss probability in the M=M=1=K queue is convex with respect to the traac intensity (arrival rate) for values of the traac i...

We propose a class of non-work-conserving service disciplines, called the Rate-Controlled Service Disciplines. When coupled with suitable admission control algorithms, Rate-Controlled Service Disciplines can provide end-to-end deterministic and statistical performance guarantees on a per-connection basis in an arbitrary topology packet-switching network. The key feature of a rate-controlled ser...

The objective of this project was to determine the genetic control of conception rate, or pregnancy percentage in Angus beef heifers. Producers from 6 herds in 5 states provided 3,144 heifer records that included breeding dates, breeding contemporary groups, service sires, and pregnancy check information. Two hundred fourteen sires of the heifers were represented; with 104 sires having less tha...

We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N.

Queuing is the common activity of customers or people to avail the desired service, which could be processed or distributed one at a time. Bank ATMs would avoid losing their customers due to a long wait on the line. The bank initially provides one ATM in every branch. But, one ATM would not serve a purpose when customers withdraw to use ATM and try to use other bank ATM. Thus the service time n...