scientific article; zbMATH DE number 7529520
From MaRDI portal
Publication:5077808
zbMath1492.90037MaRDI QIDQ5077808
Przemyslaw Korytkowski, Tomasz Piotr Wisniewski
Publication date: 20 May 2022
Full work available at URL: https://ord.pwr.edu.pl/Issues/2011/vol21/p178
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-server queueing systems with multiple priority classes
- Analyzing priority queues with 3 classes using tree-like processes
- A preemptive repeat priority queue with resampling: performance analysis
- On priority queues with impatient customers
- On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
- Discrete-time queues with discretionary priorities
- Waiting time analysis of a two-stage queueing system with priorities
- Instability of FIFO queueing networks
- Transient analysis of multiclass manufacturing systems with priority scheduling
- A multiobjective control approach to priority queues
- Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
- Re-entrant lines
- On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
- On a dual queueing system with preemptive priority service discipline
- The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service
- Optimizing a priority-discipline queueing model using fuzzy set theory
- Optimal buffer allocation in finite closed networks with multiple servers
- Analysis of a time-limited service priority queueing system with exponential timer and server vacations
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- Brownian Approximations of Multiclass Open-Queueing Networks
- The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines
- Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams
- \(M/M/1\) queue with impatient customers of higher priority
This page was built for publication: