In scheduling one is given a set of jobs which has to to be distributed on machines or processors. The problem types in this field are numerous. Jobs may be equipped with release times,deadlines and precedence constraints and may be scheduled with preemptive or non-preemptive policies. The objective can be e.g. to minimize the makespan, the number of needed machines, the (weighted) sum of completion times and so on and so forth.
In real-time scheduling the input consists of a set of tasks that release jobs periodically or sporadically.
We work on algorithmic aspects in this field as well as on complexity issues.
Apart from the obvious application in computer science, scheduling is also of high practical impact in operations research.