The lagged PSA for estimating peak congestion in multiserver Markovian queues with periodic arrival rates

Article Abstract:

A revised simple peak hour approximation (SPHA) is proposed for the estimation of peak congestion in multiserver queuing systems having exponential service times and time-changing periodic Poisson intervals. Derivation of this lagged pointwise stationary approximation (lagged PSA) involves estimation of the time of the actual peak congestion by the time of peak congestion in an infinite server model, followed by substitution of the arrival rate at this time in the corresponding stationary finite server model. The lagged PSA is demonstrated to be frequently more precise than the SPHA and to lead to significantly smaller errors when average service times are larger than a half an hour. Lastly, the lagged PSA correctly determines appropriate staffing levels to achieve targeted performance levels to maintain low congestion.

Author: Kolesar, Peter J., Green, Linda V.
Markov processes, Peak load

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


On the efficiency of imbalance in multi-facility multi-server service systems

Article Abstract:

An analysis is performed to examine the problem of the simultaneous allocation of servers and demands in multi-facility multi-server service systems for an optimal system peformance measure. It is assumed that the demand stream is homogeneous and has uniform service time distribution that is free from the influence of the server or the facility. Simple approximations and numerical results demonstrate that uneven allocation of indidivual facilities enhances the overall efficiency of a multi-facility system with Poisson arrivals. Findings reveal that, for any given number of facilities and a specified number of servers, server assignment is optimal if it is maximal according to the partial order of majorization.

Author: Guha, Debashis, Green, Linda V.
Resource allocation

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A note on approximating peak congestion in M(sub t)/G/infinity queues with sinusoidal arrivals

Article Abstract:

A study was conducted to analyze the M(sub t)/G/infinity queue wherein the arrivals of customers at service facilities correlate with a sinusoidal Poisson process. The sinusoidal Poisson process supports an arrival rate given by the amplitude of the arrival function and period. Two factors were found to influence the accuracy of the approximation, namely, the service rate and the relative amplitude. In addition, congestion resulting from the peak epoch that occurs after the peak in the arrival rate function was analyzed. Results indicated that the anticipated number of customers during peak congestion can be estimated based on service distributions supporting a coefficient of variation between 0 and 1.

Author: Kolesar, Peter J., Green, Linda V.
Information Systems & Theory, Service Industries, Research, Services industry, Poisson processes

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Analysis, Queuing theory
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.