Dynamic scheduling of a single-server two-class queue with constant retrial policy
From MaRDI portal
Publication:1945568
DOI10.1007/s10479-011-0950-zzbMath1263.90027MaRDI QIDQ1945568
Publication date: 8 April 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0950-z
scheduling; dynamic programming; Markov process; retrial queue; constant retrial policy; \(c\mu\)-rule; FCFS
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
Related Items
Infinite-server queueing tandem with Markovian arrival process and service depending on its state, A queueing model with two classes of retrial customers and paired services, An Overview for Markov Decision Processes in Queues and Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accessible bibliography on retrial queues: progress in 2000-2009
- Optimal stochastic scheduling in a single server biclass retrial queueing system
- Single line queue with repeated demands
- A survey of retrial queues
- A survey on retrial queues
- On optimal polling policies
- Retrial queues with collision arising from unslotted CSMA/CD protocol
- Assigning a single server to inhomogeneous queues with switching costs
- Single server retrial queues with priority calls.
- A retrial BMAP/PH/N system
- Stochastic scheduling of parallel queues with set-up costs
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- A classified bibliography of research on retrial queues: Progress in 1990--1999
- Threshold policies for controlled retrial queues with heterogeneous servers
- A bibliographical guide to the analysis of retrial queues through matrix analytic techniques
- The cμ rule revisited
- Retrial Queueing Systems
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
- OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS
- Retrial Queues
