Single-Server Queueing Systems with Uniformly Limited Queueing Time

22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The paper considers the queueing system GI/G/1 with a type of customer impatience, namely, that the total queueing-time is uniformly limited. Using Lindiley's approach [10], an integral equation for the limiting waiting- time distribution is derived, and this is solved explicitly for M/G/1 using an expansion of the Pollaczek-Khintchine formula. It is also solved, in principle for Ej/G/l, and explicitly for Ej/Ek/l. A duality noted between GIA(x)/GB(x)/l and GIB(x)/GA(x)/l relates solutions for GI/Ek/l to Ek/G/l. Finally the equation for the busy period in GI/G/l is derived and related to the no-customer-loss distribution and dual distributions. © 1964, Australian Mathematical Society. All rights reserved.

Cite

CITATION STYLE

APA

Daley, D. J. (1964). Single-Server Queueing Systems with Uniformly Limited Queueing Time. Journal of the Australian Mathematical Society, 4(4), 489–505. https://doi.org/10.1017/S1446788700025325

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free