Provable bounds for the mean queue lengths in a heterogeneous priority queue

DOI10.1023/A:1019187320989zbMath0966.90021OpenAlexW1548466153MaRDI QIDQ5928757

H. Leemans

Publication date: 3 April 2001

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019187320989

zbMATH Keywords

boundsheterogeneous priority queuematrix-geometricprecedence relation technique

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service ⋮ MAP/(PH/PH)/c Queue with Self-Generation of Priorities and Non-Preemptive Service ⋮ The Impact of Self-Generation of Priorities on Multi-Server Queues with Finite Capacity

This page was built for publication: Provable bounds for the mean queue lengths in a heterogeneous priority queue