Abstract
In this paper, a single-channel bulk service queueing system is considered. Given an accumulation level r, the server stops processing new customers whenever the queue falls below r and resumes service when the queue reaches level r. We have developed a recursive numerical procedure to find the steady-state system size probabilities. We assess accuracy and efficacy of the recursive procedure by comparing it to the exact solution procedure. Effectiveness and computation time of the recursive procedure are further assessed through comparison with other approximate solution procedures on a sample of 323 experimental problems.
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.
