Routing and Staffing When Servers Are Strategic

Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research 2016-07, Vol.64 (4), p.1033-1050
Hauptverfasser: Gopalakrishnan, Ragavendran, Doroudi, Sherwin, Ward, Amy R., Wierman, Adam
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1050
container_issue 4
container_start_page 1033
container_title Operations research
container_volume 64
creator Gopalakrishnan, Ragavendran
Doroudi, Sherwin
Ward, Amy R.
Wierman, Adam
description Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how hard a person works can depend both on how much work there is and how the work is divided between the people responsible for it. In a service system, the routing and staffing policies control such workload incentives; and so the rate servers work will be impacted by the system’s routing and staffing policies. This observation has consequences when modeling service system performance, and our objective in this paper is to investigate those consequences. We do this in the context of the M / M / N queue, which is the canonical model for large service systems. First, we present a model for “strategic” servers that choose their service rate to maximize a trade-off between an “effort cost,” which captures the idea that servers exert more effort when working at a faster rate, and a “value of idleness,” which assumes that servers value having idle time. Next, we characterize the symmetric Nash equilibrium service rate under any routing policy that routes based on the server idle time (such as the longest idle server first policy). We find that the system must operate in a quality-driven regime, in which servers have idle time, for an equilibrium to exist. The implication is that to have an equilibrium solution the staffing must have a first-order term that strictly exceeds that of the common square-root staffing policy. Then, within the class of policies that admit an equilibrium, we (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. Finally, we end by exploring the question of whether routing policies that are based on the service rate, instead of the server idle time, can improve system performance.
doi_str_mv 10.1287/opre.2016.1506
format Article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_gale_infotracgeneralonefile_A460448176</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A460448176</galeid><jstor_id>24740507</jstor_id><sourcerecordid>A460448176</sourcerecordid><originalsourceid>FETCH-LOGICAL-c604t-f8baacbdba46750d45c8cc858d505b3ff669e85fe340bf3abea988c9a663e0173</originalsourceid><addsrcrecordid>eNqFkd1r2zAUxcVoYenH694GgUGfZvfKlmTlMZR1LRQKTcv6JmT5ylVI7FSSR_ffTyajWSBQhCQk_c7VkQ4hXyjktJDVZb_xmBdARU45iE9kQnkhMs5EeUQmACVkpWDPn8lJCEsAmHHBJ-TyoR-i69qp7prpImprx8WvF-ymC_S_0Yfp3GM68Tpi68wZObZ6FfD833xKnq5_PF7dZHf3P2-v5neZEcBiZmWttambWjNRcWgYN9IYyWXDgdeltULMUHKLJYPalrpGPZPSzLQQJQKtylPybVt34_vXAUNUy37wXbpSFaKSFFIvdlSrV6hcZ_vk06xdMGrOkhEmaSUSlR2gWuzQ61XfoXVpe4_PD_CpNbh25qDgYk-QmIhvsdVDCGof_P4fWA_BdRjSEFz7EsOWP2TE-D4Ej1ZtvFtr_0dRUGPmasxcjZmrMfMk-LoVLEPs_TtdsIoBh2r3E-Oj_Dp8VO8vM960HA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2678107812</pqid></control><display><type>article</type><title>Routing and Staffing When Servers Are Strategic</title><source>Jstor Complete Legacy</source><source>INFORMS PubsOnLine</source><source>Business Source Complete</source><creator>Gopalakrishnan, Ragavendran ; Doroudi, Sherwin ; Ward, Amy R. ; Wierman, Adam</creator><creatorcontrib>Gopalakrishnan, Ragavendran ; Doroudi, Sherwin ; Ward, Amy R. ; Wierman, Adam</creatorcontrib><description>Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how hard a person works can depend both on how much work there is and how the work is divided between the people responsible for it. In a service system, the routing and staffing policies control such workload incentives; and so the rate servers work will be impacted by the system’s routing and staffing policies. This observation has consequences when modeling service system performance, and our objective in this paper is to investigate those consequences. We do this in the context of the M / M / N queue, which is the canonical model for large service systems. First, we present a model for “strategic” servers that choose their service rate to maximize a trade-off between an “effort cost,” which captures the idea that servers exert more effort when working at a faster rate, and a “value of idleness,” which assumes that servers value having idle time. Next, we characterize the symmetric Nash equilibrium service rate under any routing policy that routes based on the server idle time (such as the longest idle server first policy). We find that the system must operate in a quality-driven regime, in which servers have idle time, for an equilibrium to exist. The implication is that to have an equilibrium solution the staffing must have a first-order term that strictly exceeds that of the common square-root staffing policy. Then, within the class of policies that admit an equilibrium, we (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. Finally, we end by exploring the question of whether routing policies that are based on the service rate, instead of the server idle time, can improve system performance.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.2016.1506</identifier><language>eng</language><publisher>Linthicum: INFORMS</publisher><subject>Analysis ; Equilibrium ; File servers ; Forecasts and trends ; Game theory ; Incentives ; Methods ; Operations research ; Policies ; Routing ; scheduling ; Servers ; service systems ; staffing ; strategic servers ; Workforce planning ; Workload ; Workloads</subject><ispartof>Operations research, 2016-07, Vol.64 (4), p.1033-1050</ispartof><rights>2016 INFORMS</rights><rights>COPYRIGHT 2016 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences Jul/Aug 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c604t-f8baacbdba46750d45c8cc858d505b3ff669e85fe340bf3abea988c9a663e0173</citedby><cites>FETCH-LOGICAL-c604t-f8baacbdba46750d45c8cc858d505b3ff669e85fe340bf3abea988c9a663e0173</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/24740507$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.2016.1506$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3679,27901,27902,57992,58225,62589</link.rule.ids></links><search><creatorcontrib>Gopalakrishnan, Ragavendran</creatorcontrib><creatorcontrib>Doroudi, Sherwin</creatorcontrib><creatorcontrib>Ward, Amy R.</creatorcontrib><creatorcontrib>Wierman, Adam</creatorcontrib><title>Routing and Staffing When Servers Are Strategic</title><title>Operations research</title><description>Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how hard a person works can depend both on how much work there is and how the work is divided between the people responsible for it. In a service system, the routing and staffing policies control such workload incentives; and so the rate servers work will be impacted by the system’s routing and staffing policies. This observation has consequences when modeling service system performance, and our objective in this paper is to investigate those consequences. We do this in the context of the M / M / N queue, which is the canonical model for large service systems. First, we present a model for “strategic” servers that choose their service rate to maximize a trade-off between an “effort cost,” which captures the idea that servers exert more effort when working at a faster rate, and a “value of idleness,” which assumes that servers value having idle time. Next, we characterize the symmetric Nash equilibrium service rate under any routing policy that routes based on the server idle time (such as the longest idle server first policy). We find that the system must operate in a quality-driven regime, in which servers have idle time, for an equilibrium to exist. The implication is that to have an equilibrium solution the staffing must have a first-order term that strictly exceeds that of the common square-root staffing policy. Then, within the class of policies that admit an equilibrium, we (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. Finally, we end by exploring the question of whether routing policies that are based on the service rate, instead of the server idle time, can improve system performance.</description><subject>Analysis</subject><subject>Equilibrium</subject><subject>File servers</subject><subject>Forecasts and trends</subject><subject>Game theory</subject><subject>Incentives</subject><subject>Methods</subject><subject>Operations research</subject><subject>Policies</subject><subject>Routing</subject><subject>scheduling</subject><subject>Servers</subject><subject>service systems</subject><subject>staffing</subject><subject>strategic servers</subject><subject>Workforce planning</subject><subject>Workload</subject><subject>Workloads</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><recordid>eNqFkd1r2zAUxcVoYenH694GgUGfZvfKlmTlMZR1LRQKTcv6JmT5ylVI7FSSR_ffTyajWSBQhCQk_c7VkQ4hXyjktJDVZb_xmBdARU45iE9kQnkhMs5EeUQmACVkpWDPn8lJCEsAmHHBJ-TyoR-i69qp7prpImprx8WvF-ymC_S_0Yfp3GM68Tpi68wZObZ6FfD833xKnq5_PF7dZHf3P2-v5neZEcBiZmWttambWjNRcWgYN9IYyWXDgdeltULMUHKLJYPalrpGPZPSzLQQJQKtylPybVt34_vXAUNUy37wXbpSFaKSFFIvdlSrV6hcZ_vk06xdMGrOkhEmaSUSlR2gWuzQ61XfoXVpe4_PD_CpNbh25qDgYk-QmIhvsdVDCGof_P4fWA_BdRjSEFz7EsOWP2TE-D4Ej1ZtvFtr_0dRUGPmasxcjZmrMfMk-LoVLEPs_TtdsIoBh2r3E-Oj_Dp8VO8vM960HA</recordid><startdate>20160701</startdate><enddate>20160701</enddate><creator>Gopalakrishnan, Ragavendran</creator><creator>Doroudi, Sherwin</creator><creator>Ward, Amy R.</creator><creator>Wierman, Adam</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>XI7</scope><scope>JQ2</scope><scope>K9.</scope></search><sort><creationdate>20160701</creationdate><title>Routing and Staffing When Servers Are Strategic</title><author>Gopalakrishnan, Ragavendran ; Doroudi, Sherwin ; Ward, Amy R. ; Wierman, Adam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c604t-f8baacbdba46750d45c8cc858d505b3ff669e85fe340bf3abea988c9a663e0173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Analysis</topic><topic>Equilibrium</topic><topic>File servers</topic><topic>Forecasts and trends</topic><topic>Game theory</topic><topic>Incentives</topic><topic>Methods</topic><topic>Operations research</topic><topic>Policies</topic><topic>Routing</topic><topic>scheduling</topic><topic>Servers</topic><topic>service systems</topic><topic>staffing</topic><topic>strategic servers</topic><topic>Workforce planning</topic><topic>Workload</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gopalakrishnan, Ragavendran</creatorcontrib><creatorcontrib>Doroudi, Sherwin</creatorcontrib><creatorcontrib>Ward, Amy R.</creatorcontrib><creatorcontrib>Wierman, Adam</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>Business Insights: Essentials</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gopalakrishnan, Ragavendran</au><au>Doroudi, Sherwin</au><au>Ward, Amy R.</au><au>Wierman, Adam</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Routing and Staffing When Servers Are Strategic</atitle><jtitle>Operations research</jtitle><date>2016-07-01</date><risdate>2016</risdate><volume>64</volume><issue>4</issue><spage>1033</spage><epage>1050</epage><pages>1033-1050</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><abstract>Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how hard a person works can depend both on how much work there is and how the work is divided between the people responsible for it. In a service system, the routing and staffing policies control such workload incentives; and so the rate servers work will be impacted by the system’s routing and staffing policies. This observation has consequences when modeling service system performance, and our objective in this paper is to investigate those consequences. We do this in the context of the M / M / N queue, which is the canonical model for large service systems. First, we present a model for “strategic” servers that choose their service rate to maximize a trade-off between an “effort cost,” which captures the idea that servers exert more effort when working at a faster rate, and a “value of idleness,” which assumes that servers value having idle time. Next, we characterize the symmetric Nash equilibrium service rate under any routing policy that routes based on the server idle time (such as the longest idle server first policy). We find that the system must operate in a quality-driven regime, in which servers have idle time, for an equilibrium to exist. The implication is that to have an equilibrium solution the staffing must have a first-order term that strictly exceeds that of the common square-root staffing policy. Then, within the class of policies that admit an equilibrium, we (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. Finally, we end by exploring the question of whether routing policies that are based on the service rate, instead of the server idle time, can improve system performance.</abstract><cop>Linthicum</cop><pub>INFORMS</pub><doi>10.1287/opre.2016.1506</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0030-364X
ispartof Operations research, 2016-07, Vol.64 (4), p.1033-1050
issn 0030-364X
1526-5463
language eng
recordid cdi_gale_infotracgeneralonefile_A460448176
source Jstor Complete Legacy; INFORMS PubsOnLine; Business Source Complete
subjects Analysis
Equilibrium
File servers
Forecasts and trends
Game theory
Incentives
Methods
Operations research
Policies
Routing
scheduling
Servers
service systems
staffing
strategic servers
Workforce planning
Workload
Workloads
title Routing and Staffing When Servers Are Strategic
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T06%3A42%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Routing%20and%20Staffing%20When%20Servers%20Are%20Strategic&rft.jtitle=Operations%20research&rft.au=Gopalakrishnan,%20Ragavendran&rft.date=2016-07-01&rft.volume=64&rft.issue=4&rft.spage=1033&rft.epage=1050&rft.pages=1033-1050&rft.issn=0030-364X&rft.eissn=1526-5463&rft_id=info:doi/10.1287/opre.2016.1506&rft_dat=%3Cgale_proqu%3EA460448176%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2678107812&rft_id=info:pmid/&rft_galeid=A460448176&rft_jstor_id=24740507&rfr_iscdi=true