Priority queues with semi-exhaustive service

DOI10.1007/BF01158579MaRDI QIDQ1908674zbMATH OpenFDO

Authors 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

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

Recommendations

• Priority queues with semiexhaustive service and class-dependent setup times.
• scientific article; zbMATH DE number 3891068
• A preemptive priority queue with a general bulk service rule
• A class of cyclic queues with priority batch service
• scientific article; zbMATH DE number 1094825
• Priority queues
• Bounded capacity priority queues
• An N-Server Cutoff Priority Queue

Cites work

• scientific article; zbMATH DE number 4041013 (Why is no real title available?)
• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline
• Composite priority single-server queue with structured batch inputs
• Generalizations of the stochastic decomposition results for single server queues with vacations
• Pseudo-conservation laws in cyclic-service systems

Cited in

(3)

• A preemptive priority queue with a general bulk service rule
• An N-Server Cutoff Priority Queue
• Priority queues with semiexhaustive service and class-dependent setup times.

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

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