Priority queues with batch Poisson arrivals

  • Authors:
  • Hideaki Takagi;Yoshitaka Takahashi

  • Affiliations:
  • IBM Research, Tokyo Research Laboratory, 5-11 Sanban-cho, Chiyoda-ku, Tokyo 102, Japan;NTT Communication Switching Laboratories, 9-11 Midori-cho 3-chome, Musashino-shi, Tokyo 180, Japan

  • Venue:
  • Operations Research Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies batch arrival M^X/G/1 priority queues without and with (multiple or single) vacations. Applying the delay busy cycle analysis, we explicity derive the Laplace-Stieltjes transforms and the first two moments of the waiting time distributions for the nonpreemptive (head-of-the-line) and preemptive resume priority queues. Conservation laws for batch arrival systems are also mentioned. The results in this paper cover many previous results as special cases.