You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On Ross's Conjectures about Queues with Non-Stationary Poisson Arrivals
D. P. Heyman
Journal of Applied Probability
Vol. 19, No. 1 (Mar., 1982), pp. 245-249
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3213936
Page Count: 5
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Ross (1978) conjectured that the average delay in a single-server queue is larger when the arrival process is a non-stationary Poisson process than when it is a stationary Poisson process with the same rate. We present an example where equality obtains. When the number of waiting-positions is finite, Ross conjectured that the proportion of lost customers is greater in the nonstationary case. We present a counterexample to this conjecture.
Journal of Applied Probability © 1982 Applied Probability Trust