Analyses of priority queues with server control

MaRDI QIDQ761343zbMATH OpenFDO

Authors J. George Shanthikumar

Publication date 1984

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

waiting time distributionssingle server queueLaplace-Stieltjes transformslevel crossing analysesremovable serverseveral non-preemptive priority classessingle server queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 4041013
• Waiting time analysis for \(\text{M}^X/\text{G}/1\) priority queues with/without vacations under random order of service discipline
• Virtual waiting times in priority-\(M/G/1\) queues with vacations
• The stationary waiting time process in single-server priority queues with general low priority arrival process
• An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals

Cited in

(8)

• Optimal Control of an M/G/1 Priority Queue Via N-Control
• Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue
• scientific article; zbMATH DE number 4126452 (Why is no real title available?)
• Virtual waiting times in priority-\(M/G/1\) queues with vacations
• Priority queues with batch Poisson arrivals
• Control of the service process in a queueing system
• A priority M/G/1 queue with application to voice/data communication
• An N-Server Cutoff Priority Queue

This page was built for publication: Analyses of priority queues with server control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761343)