A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS

DOI10.15807/jorsj.39.266zbMath0870.90063OpenAlexW1592518318MaRDI QIDQ5284948

Tetsuya Takine

Publication date: 22 January 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.39.266

zbMATH Keywords

queue lengthwaiting time distributionstwo classes of customersnonpreemptive priority queue

Mathematics Subject Classification ID

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

Related Items (11)

Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue] ⋮ A preemptive priority queue with balking ⋮ Analyzing priority queues with 3 classes using tree-like processes ⋮ Performance analysis of a single-server ATM queue with a priority scheduling. ⋮ Waiting time and queue length analysis of Markov-modulated fluid priority queues ⋮ Unnamed Item ⋮ Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model ⋮ Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue ⋮ Single-server queues with Markov-modulated arrivals and service speed ⋮ Exact tail asymptotics in a priority queue -- characterizations of the preemptive model ⋮ Exact tail asymptotics for a discrete-time preemptive priority queue

This page was built for publication: A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS