Priority queues with semi-exhaustive service

DOI10.1007/BF01158579zbMath0838.60083MaRDI QIDQ1908674

Tsuyoshi Katayama

Publication date: 5 March 1996

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

zbMATH Keywords

priority queuedelay cycle analysismultiple/single vacationsemi-exhaustive service

Mathematics Subject Classification ID

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

Related Items (1)

Priority queues with semiexhaustive service and class-dependent setup times.

Cites Work

• Unnamed Item
• Unnamed Item
• Generalizations of the stochastic decomposition results for single server queues with vacations
• Pseudo-conservation laws in cyclic-service systems
• Composite priority single-server queue with structured batch inputs
• Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline

This page was built for publication: Priority queues with semi-exhaustive service