FI:PA167 Scheduling - Course Information
PA167 SchedulingFaculty of Informatics
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- doc. Mgr. Hana Rudová, Ph.D. (lecturer)
- Guaranteed by
- doc. Mgr. Hana Rudová, Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Supplier department: Department of Computer Systems and Communications - Faculty of Informatics
- Thu 10:00–11:50 B410
- 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 53 fields of study the course is directly associated with, display
- Course objectives
- The course provides information about various types of scheduling problems from theoretical and practical perspective. It demonstrates general solution approaches for scheduling problems and the most important approaches for various classes of scheduling problems from practice.
- Learning outcomes
- 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.
- 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.
- Reservations: interval scheduling, reservation with slack.
- Timetabling: workforce constraints, tooling constraints, relation to interval scheduling. Educational timetabling, university course timetabling.
- Workforce scheduling.
- 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 the following expected evaluation given as a sum of points for homeworks and oral distance exam: A 90 and more, B 80-89, C 70-79, D 60-69, E 50-59.
There are two homeworks during the semester. It is possible to get points up to 10 points per homework. Each student is required to obtain 8 points at least from the total point of 20 points.
Each student can get 1 bonus point for activity in each lecture (e.g., student response to several easy questions and/or student questions to clarify some part of the lecture; student response to one harder question). Bonus points will be given starting from the second lecture, i.e., it is possible to get up to 11 bonus points for activity at eleven lectures.
The exam is in the form of an oral distance exam. The minimal number of points per exam is 40 out of 80. The teacher asks the student questions from several different areas of the subject during the examination. Tested knowledge will require understanding, orientation, and an overview of the issue. The student will typically not use their own materials during the exam, but questions will be asked so that their use does not affect the result of the exam.
- Language of instruction
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually.
- Teacher's information
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2020/PA167