1. 1 Welcome to G53ASD AUTOMATED SCHEDULING Lecturer: Dr. Sanja Petrovic School of Computer Science and Information Technology E-mail: sxp@cs.nott.ac.uk The University of Nottingham

2. 2 Module Details Module Code: G53ASD Location and Time: Tuesday, 11:00, room B53 Tuesday, 12:00, room B53 Prerequisites (desirable but not essential): Mathematics for Computer Scientists (G51MCS) Mathematics for Computer Scientists (G51MC2) Artificial Intelligence Methods (G51BAIM) Assessment: One written 2 hour examination

3. 3 Aim and Objectives Aim: To provide a sound understanding of the fundamental techniques and algorithms for scheduling problems from a range of commercial and service sectors. Objectives: To give an understanding of the methods and techniques that are available for building scheduling systems. To introduce a number of scheduling applications from a variety of industrial and service sectors and show how software packages are designed to solve them.

4. 4 Contents What will be covered in this course? Description of the module Introduction to Scheduling and Classification of Scheduling Problems General Purpose Procedures Applied to Scheduling 3.General Purpose Procedures Applied to Scheduling 4.Simulated Annealing 5. Tabu-Search Exercise: Tabu Search, Solution 6.Genetic Algorithm Timetabling Problems 7.Graph Coloring Heuristics

5. 5 Contents 8. University Timetabling paper: "Recent Research Directions in Automated Timetabling", Burke, E.K., Petrovic,S., accepted for publication in European Journal of Operational Research - EJOR, 2002. paper: "A Memetic Algorithm for University Exam Timetabling", Burke, E.K., Newall, J.P., Weare, R.F., 1996. In: (Eds.) Burke, E., Ross, P. The Practice and Theory of Automated Timetabling: Selected Papers from the 1st Int'l Conf. on the Practice and Theory of Automated Timetabling, Napier University, August/September 1995, Springer Lecture Notes in Computer Science Series, Vol. 1153., pp. 241-250. 9.Employee Timetabling Exercise: 10.Solving a Nurse Rostering Problem with Enhanced Tabu Search Lecture given by Dr. Kath Dowsland

6. 6 Contents 11.Nurse Rostering Lecture given by Greet Vanden Berghe Production Scheduling Single Machine Deterministic Models 12.Completion Time Models 13.Lateness Models 14.Tardiness Models 15.Sequence Dependent Setup Models Exercise: Single Machine Scheduling Problems, Solution Multiple Machines Problems 16.Project Scheduling Exercise: Project Scheduling, Solution 17.Flow Shop Scheduling Exercise: Flow Shop, Solution

7. 7 Contents 18.Job Shop Scheduling Exercise: Job Shop, Solution New Approaches to Scheduling Problems 19.Fuzzy Scheduling 20.Design of Scheduling Systems NEW 21.Demonstration of LEKIN – Software System for Production Scheduling NEW Lecture given by Gareth Beddoe 22.Revision Lecture Example of Exam Questions, Solution

8. 8 Literature Recommended Reading 1.Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, 2000. 2.Scheduling, Theory, Algorithms, and Systems, Michael Pinedo, Prentice Hall, 1995. NEW: Second Edition, 2002

9. 9 Literature Other Good Books 3. Deterministic Scheduling Theory Gary Parker, Chapman & Hill, 1995. 4. Scheduling Under Fuzziness Roman Slowinski, and Miciej Hapke, (eds) Physica-Verlag, A Springer-Verlag Company, 2000. 5.Scheduling Algorithms Peter Brucker, Spring 2001.

10. 10 Lecture Notes Lecture Notes will be available online on the module website: http://www.cs.nott.as.uk/~sxp All announcements for the module will be made in lectures and put on the course website