Abstract
Dynamic Routing of Queues with Heterogeneous Server Pools In “The Generalized c/μ Rule for Queues with Heterogeneous Server Pools,” Long, Zhang, Zhang, and Zhang study the optimal control of queueing systems with heterogeneous server pools and a single customer class. The goal is to balance the holding cost of the queue with the operating costs of the server pools. They introduce the target-allocation policy, the Gc/μ rule, and the fixed priority policy for systems with general, convex, and concave cost functions, respectively. They also consider an extension to minimize operating costs and maintain a service-level target for customers waiting in the queue. Moreover, they show that their asymptotically optimal routing policies coincide with several classic policies in the literature in special cases.
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.
