Analysis of \(M^{ X}/ G/1\) queues with impatient customers
From MaRDI portal
Publication:725404
DOI10.1007/S11134-017-9565-7zbMath1396.60096OpenAlexW2916346507MaRDI QIDQ725404
David Perry, Yoshiaki Inoue, Onno J. Boxma, Shelemyahu Zacks
Publication date: 1 August 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-017-9565-7
busy periodvirtual waiting timeimpatient customersloss probabilityactual waiting timebatch arrival queue
Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25)
Related Items (4)
On a many-to-many matched queueing system with flexible matching mechanism and impatient customers ⋮ Single server batch arrival Bernoulli feedback queueing system with waiting server, \(K\)-variant vacations and impatient customers ⋮ Vessels arrival process and its application to the SHIP/M/\(\infty\) queue ⋮ Cost and revenue analysis of an impatient customer queue with second optional service and working vacations
Cites Work
- Unnamed Item
- Unnamed Item
- Abandonment versus blocking in many-server queues: asymptotic optimality in the QED regime
- Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
- Introduction: queueing systems special issue on queueing systems with abandonments
- The \(M/G/1+G\) queue revisited
- Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
- Stochastic orders
- A batch arrival $M^X/M/c$ queue with impatient customers
- The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues
- Approximations for the \(M/GI/N +GI\) type call center
- On the probability of abandonment in queues with limited sojourn and waiting times
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
- Queuing with balking and reneging in \(M/G/1\) systems
- Single server queues with restricted accessibility
- A computational algorithm for the loss probability in the M/G/1+PH queue
- A Multiserver Queueing System with Impatient Customers
- Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
- Single-server queues with impatient customers
- On up- and downcrossings
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- Reneging Phenomena in Single Channel Queues
- UPPER FIRST-EXIT TIMES OF COMPOUND POISSON PROCESSES REVISITED
- Single-Server Queues with Service Time Dependent on Waiting Time
- General customer impatience in the queue GI/G/1
- Queuing with Impatient Customers and Ordered Service
- The virtual waiting time of the M/G/1 queue with impatient customers
This page was built for publication: Analysis of \(M^{ X}/ G/1\) queues with impatient customers