A Generalized N-Policy for an M/M/1 Queueing System and Its Optimization

  • Bae, Jong-Ho (Department of Mathematics, Jeonju University) ;
  • Kim, Jong-Woo (Department of Mathematics, Pohang University) ;
  • Lee, Eui-Yong (Department of Statistics, Sookmyung Women's University)
  • Published : 2002.05.24

Abstract

We consider a generalized N-policy for an M/M/1 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. We obtain the limiting distribution of the number of customers in the system. 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.

Keywords