Patent
1995-12-28
1999-07-13
Banankhah, Majid A.
395674, G06F 900
Patent
active
059238739
ABSTRACT:
A method determines the number of servers as a function of time required for a finite server queueing system based on a projected load. The number of servers is chosen subject to the constraint that the probability of delay before beginning service does not exceed a target probability at all times. The finite server queueing system is first advantageously modeled as an infinite-server system and the mean and variance of the number of busy servers at time t is determined and a distribution is approximated. For any time, the number of servers is chosen to be the least number so that the probability that these are all busy is less than the target probability. As an optional refinement, the infinite server target tail probability is then related to the actual delay probability in the finite server system.
REFERENCES:
G. M. Thompson, "Accounting for the multi-period impact of service when determining employee requirements for labor scheduling," J. Opns. Mgmt., vol. 11, 1993, pp. 269-287.
P. W. Glynn et al, "A New View Of The Heavy-Traffic Limit Theorem For Infinite-Server Queues," Adv. Appl. Prob., vol. 23, 1991, pp. 188-209.
W. A. Massey et al., "Unstable Asymptotics For Nonstationary Queues," Mathematics of Operations Research, vol. 19, No. 2, 1994, pp. 267-291.
S. G. Eick et al., M.sub.t /G/.infin. Queues with Sinusoidal Arrival Rates, Management Science vol. 39, No. 2, Feb. 1993, pp. 241-252.
W. A. Massey et al., "An Analysis Of The Modified Offered-Load Approximation For the Nonstationary Erlang Loss Model," The Annals of Applied Probability, vol. 4, No. 4, Nov. 1994, pp. 1145-1160.
A. E. Eckberg, Jr., "Generalized Peakedness Of Teletraffic Processes," ITC-10, Session 4.4b, Paper #3, pp. 1-7.
J. L. Davis et al., "Sensitivity to the Service-time Distribution in the Nonstationary Erlang Loss Model," Management Science, vol. 41, No. 6, Jun. 1995, pp. 1107-1116.
W. Whitt, "Understanding The Efficiency Of Multi-Server Service Systems," Management Science, vol. 38, No. 5, May 1992, pp. 708-723.
W. A. Massey et al., "Networks of infinite-server queues with nonstationary poisson input," Queueing Systems, 13, 1993, pp. 183-250.
K. W. Fendick et al., "Measurements and Approximations to Describe the Offered Traffic and Predict the Average Workload in a Single-Server Queue," Proceedings of the IEEE, vol. 77, No. 1, Jan. 1989, pp. 171-194.
S. G. Eick et al., "The Physics Of The M.sub.t /G/.infin. Queue," Operations Rsearch, vol. 41, No. 4, Jul.-Aug. 1993, pp. 731-742.
S. Halfin et al., "Heavy-Traffic Limits for Queues With Many Exponential Servers," Operations Research, vol. 29, No. 3, May-Jun. 1981, pp. 567-587.
W. Whitt, "Heavy-Traffic Approximations For Service Systems With Blocking," AT&T Bell Laboratories Technical Journal, vol. 63, No. 5, May-Jun. 1984, pp. 689-708.
W. A. Massey et al., "Networks of infinite-server queues with nonstationary Poison input," Queueing Systems, vol. 13, 1993, pp. 183-250.
Massey William A.
Whitt Ward
Banankhah Majid A.
Lucent Technologies - Inc.
LandOfFree
Method for determining server staffing in management of finite s does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for determining server staffing in management of finite s, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for determining server staffing in management of finite s will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2285757