Abstract.
We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Korea Research Foundation Grant(KRF-2002-070-C00021).
Rights and permissions
About this article
Cite this article
Bae, J., Kim, J. & Lee, E. An optimal service rate in a Poisson arrival queue with two-stage service policy*. Math Meth Oper Res 58, 477–482 (2003). https://doi.org/10.1007/s001860300291
Issue Date:
DOI: https://doi.org/10.1007/s001860300291