Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance

Document Type

Article

Publication Date

10-19-2020

Publication Title

Methodology and Computing in Applied Probability

Abstract

In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed. The customers arriving after the service initiation cannot enter the ongoing service. The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model. Secondly, under the assumption that the services are of phase type, we study the model as a continuous-time Markov chain whose generator has a very special structure. Using matrix-analytic methods we study the model in steady-state and discuss some special cases of the model as well as representative numerical examples covering a wide range of service time distributions such as constant, uniform, Weibull, and phase type.

DOI

10.1007/s11009-020-09828-4

ISSN

Print: 1387-5841, Electronic: 1573-7713

Rights

© Springer Science+Business Media, LLC, part of Springer Nature 2020

Link to Full Text

Share

COinS