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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
