The N threshold policy for the GI/M/1 queue

  • Authors:
  • Zhe George Zhang;Naishuo Tian

  • Affiliations:
  • Department of Decision Sciences, Western Washington University, Bellingham, WA 98225-9077, USA;Department of Mathematics, Yanshan University, Qinhuangdao, 066004, China

  • Venue:
  • Operations Research Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study a GI/M/1 queue with an N threshold policy. In this system, the server stops attending the queue when the system becomes empty and resumes serving the queue when the number of customers reaches a threshold value N. Using the embeded Markov chain method, we obtain the stationary distributions of queue length and waiting time and prove the stochastic decomposition properties.