Abstract
The maximization of expected reward is considered for an Mp/M/s queuing system with unlimited queue capacity. The system is controlled by dynamically changing the price charged for the facility's service in order to discourage or encourage the arrival of customers. For the finite queue capacity problem, it has been shown that all optimal policies possess a certain monotonicity property, namely, that the optimal price to advertise is a non-decreasing function of the number of customers in the system. The main result presented here is that for the unlimited capacity problem, there exist optimal stationary policies at least one of which is monotone. Also, an algorithm is presented, with numerical results, which will produce an Ɛ-optimal policy for any Ɛ > 0, and an optimal policy if a simple condition is satisfied.
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.
