A broad view of queueing theory through one issue

@article{Whitt2018ABV,
  title={A broad view of queueing theory through one issue},
  author={Ward Whitt},
  journal={Queueing Systems},
  year={2018},
  volume={89},
  pages={3-14}
}
  • W. Whitt
  • Published 12 April 2018
  • Business
  • Queueing Systems
This is an overview and appreciation of the contributions to this special issue. 
View on Springer
columbia.edu
2 Citations
Highly Influential Citations
1
Methods Citations
1

2 Citations

Citation Type

Citation Type

New Analytic Solutions of Queueing System for Shared-Short Lanes at Unsignalized Intersections
TLDR
This research explicitly derive the probability of the state of a queueing system with a short lane of a finite capacity for taking a left turn and shared lane of infinite capacity.
A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model
TLDR
The proposed solution based on HMS exceeds the problem of accessing identical client groups in the current solution of the M/Er/r queueing system and has a normal service time N(μ, σ).

References

SHOWING 1-10 OF 63 REFERENCES
The Single Server Queue.
TLDR
This classic work has a dual aim: to describe relevant mathematical techniques and to analyse the single server queue and its most important variants.
To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems
TLDR
This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually cataloging and sorting out queues.
Synchronized reneging in queueing systems with vacations
In this paper we present a detailed analysis of queueing models with vacations and impatient customers, where the source of impatience is the absence of the server. Instead of the standard assumption…
Sharing delay information in service systems: a literature survey
TLDR
This survey paper systematically review the relevant literature, summarize some of its key ideas and findings, describe the main challenges that the different approaches to the problem entail, and formulate research directions that would be interesting to consider in future work.
Performance analysis of multi-server tandem queues with finite buffers and blocking
TLDR
An efficient approximation method to determine performance characteristics such as the throughput and mean sojourn times is developed, based on decomposition into two-station subsystems, the parameters of which are determined by iteration.
The first Erlang century—and the next
  • J. Kingman
  • Economics
    Queueing Syst. Theory Appl.
  • 2009
The history of queueing theory, particularly over the first sixty years after Erlang’s 1909 paper, is summarised and assessed, with particular reference to the influence of Pollaczek and Kendall. The…
Some Limit Theorems in the Theory of Mass Service
In the paper limit theorems describing the work of a queuing system with one server are considered in the general case. In § 1 the probabilities of large values of the waiting time are studied. The…
The Regulation of Queue Size by Levying Tolls
SOME DISCUSSION has arisen recently as to whether the imposition of an "entrance fee" on arriving customers who wish to be serviced by a station and hence join a waiting line is a rational measure.…
Queues and Lévy fluctuation theory
The book provides an extensive introduction to queueing models driven by Levy-processes as well as a systematic account of the literature on Levy-driven queues. The objective is to make the reader…
Limiting diffusion approximations for the many server queue and the repairman problem
We shall consider a many server (multiple channels in parallel) queueing process in which customers arrive at the queue according to a Poisson process. The service times are assumed to be independent…
...
...