In this course students will learn the state-of-the-art techniques for a broad variety of scheduling problems. In particular, it is expected that after this course students will be able to construct mathematical models for the basic problems, classify them, address the questions on computational complexity of the problems, and apply standard algorithmic techniques to solve the problems.

PLEASE NOTE THAT THE INFORMATION ABOUT THE TEACHING AND ASSESSMENT METHOD(S) USED IN THIS COURSE IS WITH RESERVATION. THE INFORMATION PROVIDED HERE IS BASED ON THE COURSE SETUP PRIOR TO THE CORONAVIRUS CRISIS. AS A CONSEQUENCE OF THE CRISIS, COURSE COORDINATORS MAY BE FORCED TO CHANGE THE TEACHING AND ASSESSMENT METHODS USED. THE MOST UP-TO-DATE INFORMATION ABOUT THE TEACHING/ASSESSMENT METHOD(S) WILL BE AVAILABLE IN THE COURSE SYLLABUS.

This is a course track for students interested in Operations Research (OR) of the Business Research Master.

The course addresses the issues of
* Modelling production and planning problems as combinatorial optimisation problems;
* Classification of scheduling environments and objectives;
* Tractability of scheduling problems;
* Solution methods for scheduling problems, e.g., combinatorial, LP-, and DP-based techniques, including exact algorithms, approximations and fast heuristics.

Scientific articles.
Michael Pinedo, "Scheduling: Theory, Algorithms, and System" (recommended not obligatory).

Good working knowledge of algorithms and optimisation techniques.