The \(M/G/1+G\) queue revisited

DOI10.1007/s11134-010-9205-yzbMath1228.60097MaRDI QIDQ543544

Wolfgang Stadje, David Perry, Onno J. Boxma

Publication date: 17 June 2011

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-010-9205-y

zbMATH Keywords

workload; busy period; single-server queue; balking; impatience; reneging; cycle maximum; number of customers

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

CONTINUOUS REVIEW INVENTORY MODELS FOR PERISHABLE ITEMS WITH LEADTIMES, Comparison results for M/G/1 queues with waiting and sojourn time deadlines, Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism, Analysis of an \(M/M/1 + G\) queue operated under the FCFS policy with exact admission control, Analysis of \(M^{ X}/ G/1\) queues with impatient customers, Server assignment policies in queues with customer abandonments, A state dependent reinsurance model, An equilibrium analysis of a discrete-time Markovian queue with endogenous abandonments, Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue, A computational algorithm for the loss probability in the M/G/1+PH queue

Cites Work

• Rejection rules in the \(M/G/1\) queue
• Queueing models with balking and reneging
• Queuing with balking and reneging in \(M/G/1\) systems
• Deterministic customer impatience in the queueing system GI/M/1
• Single-server queues with impatient customers
• The Busy Period of an M/G/1 Queue with Customer Impatience
• TheM/G/1 Queue with Quasi-Restricted Accessibility
• On the Cycle Maximum of Mountains, Dams and Queues
• The Markovian Queue with Bounded Waiting time
• Reneging Phenomena in Single Channel Queues
• Busy period analysis for \(M/G/1\) and \(G/M/1\) type queues with restricted accessibility
• The virtual waiting time of the M/G/1 queue with impatient customers