Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-20T14:35:17.934Z Has data issue: false hasContentIssue false
  • English
  • Français

Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers

Published online by Cambridge University Press:  14 July 2016

Behnam Pourbabai  and
David Sonderman
Behnam Pourbabai*
Affiliation:
New York University
David Sonderman*
Affiliation:
University of Massachusetts
*
∗Postal address: Statistics and Operations Research, New York University, New York, NY 1006, USA.
∗∗Postal address: Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA 01003, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Approximation expressions for the server utilization factor of each server in a heterogeneous-server G/G/n queueing loss system with ordered entry are derived. The system is assumed to face a stationary counting process. Service times are generally distributed with possibly different service rates. The numerical results from this approximation method are then compared with those from a simulation study.

Keywords

QUEUEING SYSTEMSPOINT PROCESSESOVERFLOWAPPROXIMATIONCONVEYOR THEORY
Type
Short Communications
Information
Journal of Applied Probability , Volume 23 , Issue 1 , March 1986 , pp. 236 - 242
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

The authors would like to acknowledge the financial support of NSF Grant ECS-8105954.

References

Disney, R. L. (1963) Some multichannel queueing problems with ordered entry: An application to conveyor theory. J. Ind. Eng. 14, 105–108.Google Scholar
Halfin, S. (1981) Distribution of the interoverflow time for the GI/G/1 loss system. Math. Operat. Res. 6, 563–570.CrossRefGoogle Scholar
Nawijn, W. M. (1983a) Stochastic Conveyor Systems. Ph.D. Dissertation, Technische Hoge-school Twente, Afdeling der Werktuigbouwkunde.Google Scholar
Nawijn, W. M. (1983b) A note on many-server queueing systems with ordered entry, with an application to conveyor theory. J. Appl. Prob. 20, 144–152.CrossRefGoogle Scholar
Pritsker, A. A. B. (1978) Modeling and Analysis Using Q-GERT Networks. Wiley, New York.Google Scholar
Sonderman, D. (1982) An analytical model for recirculating conveyors with stochastic input and outputs. Internat. J. Production Res. 20, 591–605.Google Scholar
Whitt, W. (1982) Approximating a point process by a renewal process, 1: Two basic methods. Operat. Res. 30, 125–147.Google Scholar