Recursive solution to a quorum queueing system

  • Authors:

  • L. Tadj;C. Tadj

  • Affiliations:

  • Department of Statistics and Operations Research College of Science, King Saud University P.O. Box 2455, Riyadh 11451, Saudi Arabia;École de Technologie Supérieure, Département de Génie Électrique, 1100 Rue Notre-dame Ouest Montréal H3C 1K3, Québec, Canada

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2002

Quantified Score

Hi-index 0.98

Visualization

Abstract

In this paper, a single-channel bulk service queueing system is considered. Given an accumulation level r, the server stops processing new customers whenever the queue falls below r and resumes service when the queue reaches level r. We have developed a recursive numerical procedure to find the steady-state system size probabilities. We assess accuracy and efficacy of the recursive procedure by comparing it to the exact solution procedure. Effectiveness and computation time of the recursive procedure are further assessed through comparison with other approximate solution procedures on a sample of 323 experimental problems.