FI:PA167 Scheduling - Course Information
PA167 Scheduling
Faculty of InformaticsSpring 2015
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- doc. Mgr. Hana Rudová, Ph.D. (lecturer)
- Guaranteed by
- doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics - Timetable
- Thu 12:00–13:50 A217
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 23 fields of study the course is directly associated with, display
- Course objectives
- Graduate will be able to identify and describe various scheduling problems appearing in practice.
Graduate will be aware of general methods applicable to solve scheduling problems from in manufacturing and services.
Graduate will be aware of algorithms and solution methods for scheduling problems such as project planning, scheduling of flexible assembly systems, or educational timetabling.
Graduate will be able to solve scheduling problems with the help of studied algorithms and approaches. - Syllabus
- Examples, scheduling problem, Graham classification.
- General purpose scheduling procedures: dispatching rules, mathematical programming, local search, constraint programming.
- Project planning and scheduling: project representation, critical path, time/cost trade-offs, workforce constraints.
- Machine scheduling: dispatching rules, branch&bound, mathematical programming, shifting bottleneck.
- Scheduling of flexible assembly systems: paced and unpaced systems, flexible flow shop.
- Reservations: interval scheduling, reservation with slack.
- Timetabling: workforce constraints, tooling constraints, relation to interval scheduling. Educational timetabling, university course timetabling.
- Workforce scheduling.
- Literature
- PINEDO, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005. Springer Series in Operations Research. info
- Teaching methods
- The course is taught in the form of standard lecture. Lectures are oriented on presentation of various solving methods for different types of scheduling problems. Lectures include exercises to practice studied methods. Comprehensive list of exercises related to the subject covers all studied areas and allows self-study.
- Assessment methods
- There is one homework during a semester. It is possible to get points up to 10 points per homework.
Final written exam consists of about 9 examples and it is possible to get up to 100 points. Exam includes questions: examples (the problem is given, the choice of method might be given, typical solution: computation of the schedule), comparisons of methods or definitions, algorithms, definitions. A list of about 240 questions is available as a source for written exams.
There is following expected evaluation given as a sum of points for homeworks and final written exam: A 95 and more, B 85-94, C 75-84, D 65-74, E 60-64. - Language of instruction
- Czech
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- http://www.fi.muni.cz/~hanka/rozvrhovani
- Enrolment Statistics (Spring 2015, recent)
- Permalink: https://is.muni.cz/course/fi/spring2015/PA167