We introduced the course and discussed the scheduling activity in general. We focused on the terminology and classification. The material discussed in covered in the text book on Chapters 1 and 2. Two pages from ``Scheduling Theory, Algorithms and Systems'' (Pinedo) are available from the session Documents of the Blackboard. Most of the material discussed can also be found in that text, Chapter 2.
Exercises on the photocopies, 2.1 and 2.2.
The next lecture we finish the part on complexity hierarchies in scheudling. We then solve the project plannig problem and introduce reseource constrained project scheduling. In the second part we start reviewing mathematical programming.
Reading material Chapter 4 of the text book through page 61 and Appendix A.