Abstract
This paper presents a discrete time bulk service queue under the policy (a, c, d). The interarrival times are assumed to be independent and geometrically distributed. The customers are served by a single server under the policy (a, c, d). In this model the server begins service only when there are at least c units in the queue and he serves a maximum of d units in a batch. The server continue to serve even when the queue size is less than c but not less than a secondary limit a, after a service completion epoch. If after a service completion epoch the queue size is less than a, the server becomes idle. The service times are also assumed to be independent and geometrically distributed. The steady state probabilities and some performance measures of the model are computed.
Sign-in/Register to access full text options 
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 callMore From: International journal of information and management sciences
Disclaimer: 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.
