Xin Liu
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.
- 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.Google Scholar
- S. Kunniyur and R. Srikant. Analysis and design of an adaptive virtual queue (avq) algorithm for active queue management. ACM SIGCOMM Computer Communication Review, 31(4):123--134, 2001.Google ScholarDigital Library
- T. Lattimore and C. Szepesv´ari. Bandit Algorithms. Cambridge University Press, 2020.Google ScholarCross Ref
- X. Liu, B. Li, P. Shi, and L. Ying. POND: Pessimistic-Optimistic oNline Dispatching. arXiv preprint arXiv:2010.09995, 2020.Google Scholar
- M. J. Neely. Stochastic network optimization with application to communication and queueing systems. Synthesis Lectures on Communication Networks, 3(1):1--211, 2010.Google ScholarCross Ref
- R. Srikant and L. Ying. Communication Networks: An Optimization, Control and Stochastic Networks Perspective. Cambridge University Press, 2014.Google ScholarDigital Library
Index Terms
- A Constrained Bandit Approach for Online Dispatching
Recommendations
Peak-Aware Online Economic Dispatching for Microgrids
e-Energy '15: Proceedings of the 2015 ACM Sixth International Conference on Future Energy SystemsBy employing local renewable energy sources and power generation units while connected to the central grid, microgrid can usher in great benefits in terms of cost efficiency, power reliability, and environmental awareness. Economic dispatching is a ...
Online Scheduling of Precedence Constrained Tasks
A fundamental problem in scheduling theory is that of scheduling a set of n tasks, with precedence constraints, on $m \ge 1$ identical and parallel processors so as to minimize the makespan (schedule length). In the past, research has focused on the ...
Online Product Reviews: Implications for Retailers and Competing Manufacturers
This paper studies the effect of online product reviews on different players in a channel structure. We consider a retailer selling two substitutable products produced by different manufacturers, and the products differ in both their qualities and fits ...
Comments