Scheduling

Credits	6 credit points
Instructors	Hurink, J.L. (Universiteit Twente)
E-mail	j.l.hurink@utwente.nl
Aim	This course gives an introduction into scheduling theory and its application.
Description	The term scheduling represents the assignment of resources over time to perform tasks, jobs or activities. Feasible schedules are compared with respect to a given optimality criterion. Mostly, the optimization problem is combinatorial and very complex. From a computational point of view these problems are hard (NP-hard) and the classical techniques failing practice. In this course an overview on the most classical scheduling models is given and exact as well as heuristic solution methods are discussed for these models. In detail, the following issues are treated: - Classification of scheduling models - Single-machine models - Parallel-machines models - Open shop, flow shop and job shop models - Timetabling - Transportation - On-line models.
Organization	12 Lectures
Examination	Take home problems and oral an examination
Literature	- Handout for special subjects. The following books can be used as background and further information, but do not have to be bought): - Pinedo, Michael L: Planning and Scheduling in Manufacturing and Services; Series: Springer Series in Operations Research and Financial Engineering, 2005, With CD-ROM., Hardcover, ISBN: 0-387-2198-0. - Brucker, Peter: Scheduling Algorithms 4th ed., 2004, Springer Verlag Berlin, Hardcover, ISBN: 3-540-20524-1. - Pinedo, Michael L: Scheduling: Theory, Algorithms, and Systems, 2nd ed., 2002, Prentice Hall, ISBN: 0-13-028138-7.
Prerequisites	Basic knowledge (bachelor level) of analysis and linear algebra.

Last changed: 18-01-2012 10:21