Abstract
Suppose that customers arriving in a queueing system belong to k(2 ≤ k < ∞) mutually exclusive and exhaustive classes on the basis of their demands for service. We make the following assumptions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Prabhu, N.U. (1997). Priority Systems. In: Foundations of Queueing Theory. International Series in Operations Research & Management Science, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6205-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6205-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7845-7
Online ISBN: 978-1-4615-6205-4
eBook Packages: Springer Book Archive