M/M/c Queue with Two Priority Classes
From MaRDI portal
Publication:3450472
DOI10.1287/opre.2015.1375zbMath1327.90055OpenAlexW1938812469MaRDI QIDQ3450472
Opher Baron, Jianfu Wang, Alan Scheller-Wolf
Publication date: 6 November 2015
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2015.1375
Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (12)
Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes ⋮ Business analytics in service operations—Lessons from healthcare operations ⋮ Time-dependent analysis of an \(\mathrm{M}/\mathrm{M}/c\) preemptive priority system with two priority classes ⋮ The setting and optimization of quick queue with customer loss ⋮ Waiting times in classical priority queues via elementary lattice path counting ⋮ Stability of queueing-inventory systems with customers of different priorities ⋮ The residual time approach for \((Q, r)\) model under perishability, general lead times, and lost sales ⋮ A base-stock inventory model with service differentiation and response time guarantees ⋮ Double-sided matching queues: priority and impatient customers ⋮ Management of a Shared-Spectrum Network in Wireless Communications ⋮ The state-dependent \(\mathrm{M}/\mathrm{G}/1\) queue with orbit ⋮ Equilibrium analysis of observable express service with customer choice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-server queueing systems with multiple priority classes
- Numerical inversion of probability generating functions
- Design of manufacturing systems using queueing models
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Strategies for a Centralized Single Product Multiclass M/G/1 Make-to-Stock Queue
- The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Understanding the Efficiency of Multi-Server Service Systems
- The Distributional Little's Law and Its Applications
- Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights
- Waiting-Time Distribution of a Multi-Server, Priority Queuing System
- Diffusion Approximations for a Multiclass Markovian Service System with “Guaranteed” and “Best-Effort” Service Levels
This page was built for publication: M/M/c Queue with Two Priority Classes
