A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service

  • Authors:
  • Attahiru Sule Alfa

  • Affiliations:
  • Department of Mechanical and Industrial Engineering, University of Manitoba, Winnipeg, Man., Canada R3T 5V6

  • Venue:
  • Operations Research Letters
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a single-server queue in which the server attends to a queue only for a limited period of time and then goes on to other queues, in which case we say it proceeds on a vacation. We obtain results for the probability densities of the number of customers in the system at an arbitrary time, during vacation, and during service; the customer waiting time distribution; and the amount of work in the system at polling instants and at the start of a vacation. The results are extended to the case of multiple vacations during a cycle. We show that the length of a visit to a time-limited service system has a phase type distribution. The work is carried out in discrete time.