The stationary waiting time process in single-server priority queues with general low priority arrival process

DOI10.1080/02331938408842938zbMath0545.90041OpenAlexW2087393716MaRDI QIDQ3337186

Volker Schmidt

Publication date: 1984

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938408842938

zbMATH Keywords

boundswaiting time distributionssingle server queuehead-of-the-line disciplinepreemptive-resume priority classesstationary actual waiting timestationary virtual waiting time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (2)

On the relationship between work load and waiting time in single server queues with batch inputs ⋮ EPSTA: The coincidence of time-stationary and customer-stationary distributions

This page was built for publication: The stationary waiting time process in single-server priority queues with general low priority arrival process