Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T09:51:17.218Z Has data issue: false hasContentIssue false

An M/G/c queue in which the number of servers required is random

Published online by Cambridge University Press:  14 July 2016

Awi Federgruen*
Affiliation:
Columbia University
Linda Green*
Affiliation:
Columbia University
*
∗ Postal address: Columbia Business School, Columbia University, New York, NY 10027, USA.
∗ Postal address: Columbia Business School, Columbia University, New York, NY 10027, USA.

Abstract

Many queueing situations such as computer, communications and emergency systems have the feature that customers may require service from several servers at the same time. They may thus be delayed until the required number of servers is available and servers may be idle when customers are waiting. We consider general server-completion-time distributions and derive approximation methods for the computation of the steady-state distribution of the number of customers in queue as well as the moments of the waiting-time distribution. Extensive computational results are reported.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1984 

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.)

Article purchase

Temporarily unavailable