Abstract
A practically important model is the queueing model with controllable service rate. This paper considers a single-server model with batch Poisson input and two service modes, where switch-over times are involved when changing the service mode. A class of simple switch-over rules is considered and, using Markov decision theory, a tailor-made policy-iteration algorithm is developed for computing a rule that mimimizes the long-run average number of customers in the system.
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 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.
