Dear scheduling researcher,

We are delighted to announce the talk given by Dvir Shabtay (Ben-Gurion Uni).

The title is "On the Parameterized Complexity of Machine Scheduling Problems".

The seminar will take place on Zoom on Wednesday, January 19 at 14:00 UTC.

Join Zoom Meeting https://cesnet.zoom.us/j/94434108596?pwd=UTFuT2V3VjRiT3dwTENwRStZSkxPdz09 https://cesnet.zoom.us/j/94434108596?pwd=UTFuT2V3VjRiT3dwTENwRStZSkxPdz09

Meeting ID: 944 3410 8596 Passcode: 384746

You can follow the seminar online or offline on our Youtube channel as well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

The main goal of parameterized complexity is to try to design algorithms that are capable of solving (in reasonable time) hard problems in cases where some predefined problem parameters are of limited size. This theory was developed in the early 90s, contributing to many new techniques in the area of algorithmic design ever since. In this talk we survey the main aspects of parametrized complexity, and highlight its applicability to the area of scheduling. We also discuss some challenges and open problems for future research.

The next talk in our series will be given by

Yindong Shen (AIA Huazhong Uni) | February 2, 2022| Public transit planning and scheduling based on AVL data in China

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

With kind regards

Zdenek, Mike and Guohua