A simple derivation of the waiting-time distribution (in the queue) for the bulk-service M/G^(a,b)/1 queueing system
From MaRDI portal
Publication:6924293
Cites work
- A BULK SERVICE GI/M/1 QUEUE WITH SERVICE RATES DEPENDING ON SERVICE BATCH SIZE
- A distributional form of Little's law
- A General Class of Bulk Queues with Poisson Input
- A single-server queue with random accumulation level
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A versatile Markovian point process
- An M/M/1 queue with a general bulk service rule
- Analysis of a finite MAP/\(G\)/1 queue with group services
- Analysis of queueing-time distributions for MAP/DN/1 queue
- Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\)
- Characterizations of generalized hyperexponential distribution functions
- Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
- Computational analysis of single-server bulk-service queues, M/GY/ 1
- Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
- Exact waiting time and queue size distributions for equilibrium \(M/G/1\) queues with Pareto service
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- scientific article; zbMATH DE number 3217462 (Why is no real title available?)
- New results on the single server queue with a batch markovian arrival process
- Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1
- On modulated random measures
- Queues Solvable without Rouché's Theorem
- Ruin probabilities by Padé's method: simple moments based mixed exponential approximations (Renyi, De Vylder, Cramér-Lundberg), and high precision approximations with both light and heavy tails
- Sojourn-time distribution for \(M/G^a/1\) queue with batch service of fixed size -- revisited
- Some results for the general bulk service queueing system
- The N/G/1 queue and its detailed analysis
- The queuing system M/G^B/1 and its ramifications
- Waiting Time Distribution in a Poisson Queue with a General Bulk Service Rule
Cited in
(2)- Computational procedures and optimal pricing strategies for stochastic queueing-inventory systems with random-replenishment order size and batch-size demand
- Batch-size-sensitive queueing analysis with binomial group joining in bulk optional service system under MAP with metaheuristic cost optimization
This page was built for publication: A simple derivation of the waiting-time distribution (in the queue) for the bulk-service \(M/G^{(a,b)}/1\) queueing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924293)