No CrossRef data available.
Article contents
Basic analysis of a head-of-the-line priority queue with renewal type input
Published online by Cambridge University Press: 14 July 2016
Abstract
A single server is fed by a renewal stream of individual customers. These are of type k with probability πk, k = 1, …, N, and are all served individually. Upon completion of a service the server proceeds immediately with a customer of the lowest type (= highest priority) present, if any. Service times for type k are drawn from a general distribution function Bk(t) concentrated on (0, ∞).
We lay the foundations for a broad analysis of the model.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1975