Abstract
A single server Markovian queue is considered. The arriving units are served in batches by using Accessibility and NonAccessibility rules with varying service rates. The expressions for the steady state probabilities when the server is busy as well as idle are derived. The mean and variance for the number of units in the queue are obtained. The expected waiting time of units is also attained. Numerical results for number of units in the queue are computed for various values of and exhibited the corresponding graphs when the remaining parameters are fixed.
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.
