This paper considers a finite-buffer discrete-time GeoX/GY/1/K+ B queue with multiple vacations that has a wide range of applications including high-speed digital …
We present a model for assigning server time slots to different classes of patients. The objective is to minimize the total expected weighted waiting time of a patient (where different …
D Claeys, B Steyaert, J Walraevens, K Laevens… - Performance …, 2013 - Elsevier
In the past, many researchers have analyzed queueing models with batch service. In such models, the server typically postpones service until the number of present customers …
In Bulk service queueing models, customers are served in batches, the batches may be of fixed length or variable length. Sometimes, the service rate may depend on the number of …
D Claeys, J Walraevens, K Laevens… - European Journal of …, 2010 - Elsevier
Classification of items as good or bad can often be achieved more economically by examining the items in groups rather than individually. If the result of a group test is good, all …
Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets …
A Krishnamoorthy, AN Joshua, V Vishnevsky - Mathematics, 2021 - mdpi.com
In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a …
This paper analyzes a discrete-time single-server infinite-(finite-) buffer bulk-service queues. The inter-arrival times of successive arrivals are assumed to be independent and …
I Atencia, I Fortes, S Sánchez - Computers & Industrial Engineering, 2009 - Elsevier
It is well known that discrete-time queues are more appropriate than their continuous-time counterparts for modelling computer and telecommunication systems. This paper is …