A Constrained Bandit Approach for Online Dispatching

Xin Liu, Bin Li, Pengyi Shi, Lei Ying

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)54-56
Number of pages3
JournalPerformance Evaluation Review
Issue number2
StatePublished - Sep 2021

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'A Constrained Bandit Approach for Online Dispatching'. Together they form a unique fingerprint.

Cite this