Advances in scheduling algorithms
This course was last offered in the winter term 2019/20.
Mo 15:30 - 17:00, Place: (E4.084)
Scheduling concerns the timely allocation of tasks and personnel to resources (e.g., machines), such as to optimize some objective, like the maximum completion time of a machine or the weighted some of completion times of jobs. Many problems in scheduling are computationally intractable, but admit elegant and highly efficient approximation schemes. The goal of the seminar is to learn some recent beautiful algorithmic ideas in the domain of scheduling algorithms.