Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-03T08:43:33.056Z Has data issue: false hasContentIssue false

On the transient waiting times for a GI/M/1 priority queue

Published online by Cambridge University Press:  14 July 2016

G. Dalen
Affiliation:
University of Oslo
B. Natvig*
Affiliation:
University of Oslo
*
∗∗Postal address: Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo 3, Norway.

Abstract

In this paper we consider the GI/M/1 queueing model with infinite waiting-room capacity. The customer arriving at t = 0 will find k — 1 customers waiting. The latter customers belong to a second priority class, whereas the ones arriving in [0,∞) belong to a first priority class and have the higher priority. Within each class we have a first-in-first-out queueing discipline. A customer, once at the service-point, remains there until his service is completed. Then the next customer for service is the one of highest priority among those queueing.

For this model we derive the transient waiting times for customers belonging to both priority classes. The results are of special interest in appointment systems where customers may not turn up.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1980 

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

Present address: Norsk Hydro, 3900 Porsgrunn, Norway.

References

Bhat, U. N. (1967) Some explicit results for the queue GI/M/1 with group service. Sankhya A 29, 199206.Google Scholar
Dalen, G. (1976) An Analysis of a Generalized D/M/1 Queue (In Norwegian). Cand. real. Thesis, University of Oslo.Google Scholar
Dalen, G. and Natvig, B. (1978) On the transient waiting time for GI/M/1 with a ‘head of the line’ priority discipline (abstract). Adv. Appl. Prob. 10, 315316.CrossRefGoogle Scholar
Natvig, B. (1975) A Contribution to the Theory of Birth-and-Death Queueing Models. Ph.D. Thesis, University of Sheffield.Google Scholar
Prabhu, N. U. and Bhat, U. N. (1963) Some first passage problems and their application to queues. Sankya A 25, 281292.Google Scholar
Takács, L. (1962) A single server queue with recurrent input and exponentially distributed service times. Operat. Res. 10, 395399.CrossRefGoogle Scholar