Interrelationship between controlling arrival and service in queueing systems

42Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the interrelationship between the F-Policy problem and the truncated N-Policy problem is considered. The F-Policy problem deals with the issue of controlling arrivals to a queueing system. The N-Policy problem involves a queueing system in which the server leaves the system (for alternative jobs) when it becomes empty and returns when the queue builds up to a predetermined level. The steady state probability distribution and expressions for the measures of effectiveness for these two systems are obtained. The complementarity relationships between these two queueing systems are established. These relationships provide insight into these queueing problems and facilitate the solution to any one of the problems given the solution to the other. Through a series of propositions, other relationships between these queueing systems are also established. © 1995.

Cite

CITATION STYLE

APA

Gupta, S. M. (1995). Interrelationship between controlling arrival and service in queueing systems. Computers and Operations Research, 22(10), 1005–1014. https://doi.org/10.1016/0305-0548(94)00088-P

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