Abstract
Sun and Whitt (2017) developed a class of server-assignment rules that can help create effective breaks for servers from naturally available idleness. They found that the standard longest-idle-server-first rule and the alternative random routing generate breaks too infrequently. This paper provides theoretical justifications for these empirical findings by establishing the many-server heavy-traffic limits for server idle times with customary assignment rules. We gain insights into the server idle–busy activity patterns resulting from the server-assignment schemes in the system.
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.
