A Constrained Bandit Approach for Online Dispatching

Xin Liu; Bin Li; Pengyi Shi; Lei Ying

doi:10.1145/3512798.3512818

A Constrained Bandit Approach for Online Dispatching

Xin Liu, Bin Li, Pengyi Shi, Lei Ying

School of Electrical Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	54-56
Number of pages	3
Journal	Performance Evaluation Review
Volume	49
Issue number	2
DOIs	https://doi.org/10.1145/3512798.3512818
State	Published - Sep 2021

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/3512798.3512818

Cite this

@article{6bacc9e3c9fc4866969682af9ba78187,

title = "A Constrained Bandit Approach for Online Dispatching",

abstract = "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.",

author = "Xin Liu and Bin Li and Pengyi Shi and Lei Ying",

note = "Publisher Copyright: {\textcopyright} 2022 is held by the owner/author(s).",

year = "2021",

month = sep,

doi = "10.1145/3512798.3512818",

language = "English (US)",

volume = "49",

pages = "54--56",

journal = "Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - A Constrained Bandit Approach for Online Dispatching

AU - Liu, Xin

AU - Li, Bin

AU - Shi, Pengyi

AU - Ying, Lei

PY - 2021/9

Y1 - 2021/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85123305065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85123305065&partnerID=8YFLogxK

U2 - 10.1145/3512798.3512818

DO - 10.1145/3512798.3512818

M3 - Article

AN - SCOPUS:85123305065

SN - 0163-5999

VL - 49

SP - 54

EP - 56

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 2

ER -

A Constrained Bandit Approach for Online Dispatching

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this