Online Scheduling Meets Queueing

Lecture 1: Online Scheduling Meets Queueing I 
Lecture 2: Online Scheduling Meets Queueing II 
 

This series of talks is part of the Algorithms and Uncertainty Boot Camp. Videos for each talk area will be available through the links above.

Speakers: Nikhil Bansal, Technische Universiteit Eindhoven and Adam Wierman, Caltech

The theory of scheduling has a long and storied history. Out of this large body of work two distinct research communities have emerged and, unfortunately, researchers in each community are typically unaware of results and tools from the other community. One set of researchers, from the online scheduling community, focuses on providing competitive guarantees for scheduling disciplines in worst-case settings; while another set of researchers, from the queueing community, focuses on providing exact performance analyses of scheduling policies in stochastic/probabilistic environments. Our goal in this tutorial is to highlight places where there is potential for techniques to be developed to bridge these communities, achieving the "best of both worlds".  To that end, we will highlight some success stories from recent years in addition to promising open research directions.