Queues with Service in Random Order
From MaRDI portal
Cited in
(6)- Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
- Queues with impolite customers
- Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/1 queue under random order service discipline
- Sojourn times in a random queue with and without preemption
- Waiting time in \(\mathrm{M}/\mathrm{G}/1\) queues with impolite arrival disciplines
- Large deviations of the waiting time in the GI/G/1 queue with random order service
This page was built for publication: Queues with Service in Random Order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5180182)
