{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:05:38Z","timestamp":1767261938943,"version":"3.41.2"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2022,1,17]]},"abstract":"<jats:p>Online dispatching refers to the process (or an algorithm) that dispatches incoming jobs to available servers in realtime. The problem arises in many different fields. Examples include routing customer calls to representatives in a call center, assigning patients towards in a hospital, dispatching goods to different shipping companies, scheduling packets over multiple frequency channels in wireless communications, routing search queries to servers in a data center, selecting an advertisement to display to an Internet user, and allocating jobs to workers in crowdsourcing.<\/jats:p>","DOI":"10.1145\/3512798.3512818","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T13:13:23Z","timestamp":1642684403000},"page":"54-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Constrained Bandit Approach for Online Dispatching"],"prefix":"10.1145","volume":"49","author":[{"given":"Xin","family":"Liu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Rhode Island, RI, USA"}]},{"given":"Pengyi","family":"Shi","sequence":"additional","affiliation":[{"name":"Purdue University"}]},{"given":"Lei","family":"Ying","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"May","author":"Auer P.","year":"2002","unstructured":"P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2--3):235--256, May 2002."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383069"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"e_1_2_1_4_1","volume-title":"POND: Pessimistic-Optimistic oNline Dispatching. arXiv preprint arXiv:2010.09995","author":"Liu X.","year":"2020","unstructured":"X. Liu, B. Li, P. Shi, and L. Ying. POND: Pessimistic-Optimistic oNline Dispatching. arXiv preprint arXiv:2010.09995, 2020."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"e_1_2_1_6_1","volume-title":"Communication Networks: An Optimization, Control and Stochastic Networks Perspective","author":"Srikant R.","year":"2014","unstructured":"R. Srikant and L. Ying. Communication Networks: An Optimization, Control and Stochastic Networks Perspective. Cambridge University Press, 2014."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512798.3512818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512798.3512818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T22:26:48Z","timestamp":1752532008000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512798.3512818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,1,17]]}},"alternative-id":["10.1145\/3512798.3512818"],"URL":"https:\/\/doi.org\/10.1145\/3512798.3512818","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2022,1,17]]},"assertion":[{"value":"2022-01-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}