scientific article; zbMATH DE number 4041013
From MaRDI portal
Publication:3779558
Recommendations
- Waiting time analysis for \(\text{M}^X/\text{G}/1\) priority queues with/without vacations under random order of service discipline
- Virtual waiting times in priority-\(M/G/1\) queues with vacations
- Priority queues with batch Poisson arrivals
- An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
- scientific article; zbMATH DE number 123379
Cites work
Cited in
(40)- Priority queues with batch Poisson arrivals
- Workload in queues having priorities assigned according to service time
- A note on conservation laws for a multi-class service queueing system with setup times
- The \(M^ X/G/1\) queue with single and multiple vacations under the LIFO service regime
- Priority queues with semiexhaustive service and class-dependent setup times.
- A finite capacity multi-queueing system with priorities and with repeated server vacations
- Virtual waiting times in priority-\(M/G/1\) queues with vacations
- Priority queues with semi-exhaustive service
- Mixed gated/exhaustive service in a polling model with priorities
- A queueing system with decomposed service and inventoried preliminary services
- From exhaustive vacation queues to preemptive priority queues with general interarrival times
- Analysis of preemptive loss priority queues with preemption distance
- A working vacation queue with priority customers and vacation interruptions
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Improving efficiency of service systems by performing a part of the service without the customer's presence
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- Priority queueing system with a single server serving two queues \(\mathrm{M}^{[X_{1}]}, \mathrm{M}^{[X_{2}]}/\mathrm{G}_1, \mathrm{G}_2/1\) with balking and optional server vacation
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- GI/M/1 Queue with Server Vacations
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- scientific article; zbMATH DE number 123379 (Why is no real title available?)
- scientific article; zbMATH DE number 4126452 (Why is no real title available?)
- Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
- PREEMPTIVE RESUME PRIORITIES IN AN N-CLASS STRUCTURED QUEUE WITH SERVER VACATIONS
- An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
- A PREEMPTIVE PRIORITY QUEUE AS A MODEL WITH SERVER VACATIONS
- Queueing with priorities and standard service: stoppable and unstoppable servers
- On the three-queue priority polling system with threshold service policy
- Reducing delay in retrial queues by simultaneously differentiating service and retrial rates
- On a batch arrival queue with priority and single vacation
- The M/M/$c$ queueing model with preemptive priority and multiple synchronous working vacation
- Waiting time analysis for \(\text{M}^X/\text{G}/1\) priority queues with/without vacations under random order of service discipline
- A priority system with working vacations of a server
- A two-queue polling model with two priority levels in the first queue
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems
- Analyses of priority queues with server control
- Delay analysis of discrete-time priority queue with structured inputs
- A tandem Jackson network with feedback to the first node
- Expected waiting times in polling systems under priority disciplines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779558)
