What is it about?
Time-dependent queuing problems are extremely difficult to solve analytically, which leads to many OR practitioners unable (or unwilling) to understand the complex mathematics involved. This paper provides a simple approximation which is good enough to suffice in most practical situations.
Featured Image
Why is it important?
The paper provides an opportunity for OR practioners to gain an insight into queueing situations where paraders change over time.
Perspectives
The author has used the methodology in a number of real-life situations.
Jeff Griffiths
Cardiff University
Read the Original
This page is a summary of: Approximation to the Transient Solution of theM/Ek/1 Queue, INFORMS Journal on Computing, November 2008, INFORMS,
DOI: 10.1287/ijoc.1070.0262.
You can read the full text:
Contributors
The following have contributed to this page
