Priority queues with semi-exhaustive service
From MaRDI portal
Publication:1908674
DOI10.1007/BF01158579zbMATH Open0838.60083MaRDI QIDQ1908674FDOQ1908674
Authors: Tsuyoshi Katayama
Publication date: 5 March 1996
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
- Priority queues with semiexhaustive service and class-dependent setup times.
- scientific article
- 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
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline
- Title not available (Why is that?)
- 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
Cited In (3)
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)