The module deals with deterministic scheduling problems (also called process planning, machine scheduling or sequencing problems). Scheduling problems occur in many applications, e.g. in business administration, logistics, transportation or in healthcare.
A set of activities (jobs) has to be executed on a set of resources (processors or machines). The goal is to find an optimal schedule that minimises or maximises a given optimization criterion. The focus is on the classification and complexity of scheduling problems, mathematical methods as well as exact and approximation algorithms for solving scheduling problems.
- Teacher: Klaus Jansen