Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
