Abstract
This paper considers a multiclass routing and server allocation problem in a queueing system of multiple stations in parallel with penalties for switching the server between stations. We proceed by dynamically ranking the queues so that if all arrivals ceased, switches of the server between queues would be maximally delayed by serving queues in order of rank. The main result of this paper shows that we may improve any policy by constructing a greedy version that routes arriving customers to the queue of highest acceptable rank and allocates the server to the queue of highest rank whenever it switches. We also establish analogous results for a variant of the problem that encourages fairness in server allocation by restricting attention to pseudocyclic policies which visit each queue periodically.
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.
