Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475698 | Computers & Operations Research | 2015 | 12 Pages |
Abstract
We consider a finite capacity single server queue in which the customers arrive according to a Markovian arrival process. The customers are served in batches following a ‘general bulk service rule’. The service times, which depend on the size of the batch, are generally distributed. We obtain, in steady-state, the joint distribution of the random variables of interest at various epochs. Efficient computational procedures in the case of phase type services are presented. An illustrative numerical example to bring out the qualitative nature of the model is presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
A. Banerjee, U.C. Gupta, S.R. Chakravarthy,