Dear scheduling researcher,

We are delighted to announce the talk given by Nicole Megow (Universität Bremen). The title is "Learning-Augmented Online Algorithms for Scheduling and Routing".

The seminar will take place on Zoom on Wednesday, June 8 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/93281103550?pwd=ckU0dWRRYWFUb2tRV2duakRjMVgyZz09 Meeting ID: 932 8110 3550 Passcode: 197150

You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows. Online optimization refers to solving problems where an initially unknown input is revealed incrementally, and irrevocable decisions must be made not knowing future requests. The assumption of not having any prior knowledge about future requests seems overly pessimistic. Given the success of machine-learning methods and data-driven applications, one may expect to have access to predictions about future requests. However, simply trusting them might lead to very poor solutions, as these predictions come with no quality guarantee. In this talk we present recent developments in the young line of research that integrates such error-prone predictions into algorithm design to break through worst case barriers. We discuss different prediction models and algorithmic challenges with a focus on online scheduling and routing and give an outlook to network design problems.

The next talk in our series will be given by: Maurice Queyranne (Sauder School, UBC)| June 22 | On Polyhedral Approaches to Scheduling Problems

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua