Abstract
We consider a discrete-time single-server queue where the idle server waits for reaching a level N in the queue size to start a batch service of N messages, although the following arrivals during the busy period receive single services. We find the stationary distributions of the queue and system lengths as well as some performance measures. The vacation and busy periods of the system and the number of messages served during a busy period are also analyzed. The stationary distributions of the time spent waiting in the queue and in the system are studied too. Finally, a total expected cost function is developed to determine the optimal operating N-policy at minimum cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
