General customer impatience in the queue GI/G/1
From MaRDI portal
Publication:5344567
DOI10.2307/3211884zbMATH Open0134.14402OpenAlexW2331476099MaRDI QIDQ5344567FDOQ5344567
Authors: D. J. Daley
Publication date: 1965
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3211884
Cited In (37)
- Simultaneous arrival of customers to two different queues and modeling dependence via copula approach
- Queueing theory
- Analysis of customers' impatience in an \(\mathrm{M}/\mathrm{M}/1\) queue with working vacations
- A disaster queue with Markovian arrivals and impatient customers
- The virtual waiting time of the M/G/1 queue with customers of \(n\) types of impatience
- On first-come, first-served queues with two classes of impatient customers
- An \(\mathrm{M}/\mathrm{PH}/K\) queue with constant impatient time
- Queues with system disasters and impatient customers when system is down
- Analysis of customers' impatience in queues with server vacations
- On stability of queueing networks with job deadlines
- Analysis of a dynamic assignment of impatient customers to parallel queues
- Waiting time probabilities in the \(M/G /1 + M\) queue
- Approximations for the \(M/GI/N +GI\) type call center
- Waiting time analysis of multi-class queues with impatient customers
- Analysis of renewal batch arrival queues with multiple vacations and geometric abandonment
- Equilibrium strategies for queues with impatient customers
- On a doubly dynamically controlled supermarket model with impatient customers
- A Path Construction for the Virtual Waiting Time of an M/G/1 Queue
- The stationary workload of the \(G/M/1\) queue with impatient customers
- Comparison results for \(M/G/1\) queues with waiting and sojourn time deadlines
- On priority queues with impatient customers
- Finite-buffer queues with workload-dependent service and arrival rates
- Analysis of an \(\mathrm{M}/\mathrm{M}/1\) queue with vacations and impatience timers which depend on the server's states
- The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues
- On Queueing with Customer Impatience Until the End of Service
- STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS
- Analysis of \(M^{ X}/ G/1\) queues with impatient customers
- Queues with simultaneous arrival of customers and the dependence structure of the waiting times
- Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
- Queues with slow servers and impatient customers
- A batch arrival single server queue with server providing general service in two fluctuating modes and reneging during vacation and breakdowns
- The \(M/M/1\) queue with synchronized abandonments
- The single server vacation queueing model with geometric abandonments
- Perishable inventory systems with batch demand and arrivals
- Synchronized reneging in queueing systems with vacations
- Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control
- Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
This page was built for publication: General customer impatience in the queue GI/G/1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5344567)