Abstract
ABSTRACT We consider the M / M / k queueing model modified as follows: we assume that one can decide how many servers are working at any time. Suppose that at a given time instant, there are k + l customers in the system and that they are all waiting for service. Our aim is to determine how many servers should be used in order to reduce the number of customers to k + r, where 0 ≤ r < l , as rapidly as possible, while taking the control costs into account. The dynamic programming equation satisfied by the value function is obtained in the general case, and particular problems are solved explicitly.
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.
