Finite capacity single-server queue with Poisson input, general service and delayed renovation
From MaRDI portal
Publication:2079417
DOI10.1016/j.ejor.2022.05.047OpenAlexW4283388666MaRDI QIDQ2079417
Mikhail Konovalov, Rostislav Razumchik
Publication date: 29 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.047
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing system with processor sharing and limited memory under control of the AQM mechanism
- The computation of key properties of Markov chains via perturbations
- Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping
- A note on scalarizing functions under changing sets of criteria
- Stationary time characteristics of the \(GI/M/n/\infty \) system with some variants of the generalized renovation discipline
- Optimality and efficiency. I
- Nonscalarized multiobjective global optimization
- Queueing systems with renovation
- Queues with dropping functions and autocorrelated arrivals
- Scalarizing vector optimization problems
- Stochastic clearing systems
- The \(GI/M/n/\infty \) queuing system with generalized renovation
- Minimizing expected discounted cost in a queueing loss model with discriminating arrivals
- On the service time in a workload-barrier \(\mathrm{M}/\mathrm{G}/1\) queue with accepted and blocked customers
- Late-rejection, a strategy to perform an overflow policy
- Analysis of AQM queues with queue size based packet dropping
- Queues with delayed feedback
- Queues with negative arrivals
- ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS
- Queueing Theory
- Stability Analysis of Regenerative Queueing Models
- Numerical Methods for Structured Markov Chains
