Course Information

PA167 Scheduling

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught in person.

Teacher(s)

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

Timetable

Mon 19. 2. to Thu 9. 5. Thu 14:00–15:50 A318

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 54 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.

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.
• Reservations: interval scheduling, reservation with slack.
• Timetabling: workforce constraints, tooling constraints, relation to interval scheduling. Educational timetabling, university course timetabling.

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 a standard lecture. Lectures are oriented on the presentation of various solving methods for different types of scheduling problems. Lectures include exercises to practice studied methods. A comprehensive list of exercises related to the subject covers all studied areas and allows self-study. Two ROPOTs provide further practice.

Assessment methods

There is the following expected evaluation given as a sum of points for two written exams together with bonus points: A 90 and more, B 80-89, C 70-79, D 60-69, E 55-59.
There is one written test during a semester. It is possible to get points up to 20 points. Each student is required to obtain 8 points, at least from the total point of 20 points.
Two answer sheets will be made available during the semester, from Friday to Sunday. Up to 2.5 points can be earned for each answer sheet, and any number of passes are allowed, with the best pass being awarded.
Each student can get 1 bonus point for an 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).
The final written exam consists of about 7 examples, and it is possible to get up to 80 points. It is necessary to get more than 40 out of 75 points. The 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, and definitions. A list of about 240 questions is available as a source for written exams.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/el/fi/jaro2024/PA167/index.qwarp

PA167 Scheduling

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught in person.

Teacher(s)

doc. Mgr. Hana Rudová, Ph.D. (lecturer)
Mgr. Václav Sobotka (assistant)

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

Timetable

Tue 14. 2. to Tue 9. 5. Tue 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 54 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.

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.
• Reservations: interval scheduling, reservation with slack.
• Timetabling: workforce constraints, tooling constraints, relation to interval scheduling. Educational timetabling, university course timetabling.

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 a standard lecture. Lectures are oriented on the presentation of various solving methods for different types of scheduling problems. Lectures include exercises to practice studied methods. A comprehensive list of exercises related to the subject covers all studied areas and allows self-study. Two ROPOTs provide further practice.

Assessment methods

There is the following expected evaluation given as a sum of points for two written exams together with bonus points: A 90 and more, B 80-89, C 70-79, D 60-69, E 55-59.
There is one written test during a semester. It is possible to get points up to 20 points. Each student is required to obtain 8 points, at least from the total point of 20 points.
Two answer sheets will be made available during the semester, from Friday to Sunday. Up to 2.5 points can be earned for each answer sheet, and any number of passes are allowed, with the best pass being awarded.
Each student can get 1 bonus point for an 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).
The final written exam consists of about 7 examples, and it is possible to get up to 80 points. It is necessary to get more than 40 out of 75 points. The 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, and definitions. A list of about 240 questions is available as a source for written exams.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/el/fi/jaro2023/PA167/index.qwarp

PA167 Scheduling

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught in person.

Teacher(s)

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

Timetable

Mon 14. 2. to Mon 16. 5. Mon 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 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.

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.
• Vehicle routing problems.
• Reservations: interval scheduling, reservation with slack.
• Timetabling: workforce constraints, tooling constraints, relation to interval scheduling. Educational timetabling, university course timetabling.

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 a standard lecture. Lectures are oriented on the presentation of various solving methods for different types of scheduling problems. Lectures include exercises to practice studied methods. A 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 two written exams together with bonus points: A 90 and more, B 80-89, C 70-79, D 60-69, E 50-59.
There is one written test during a semester. It is possible to get points up to 20 points. 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).
The final written exam consists of about 7 examples and it is possible to get up to 80 points. It is necessary to get more than 40 out of 80 points. The 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/el/fi/jaro2022/PA167/index.qwarp

PA167 Scheduling

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught online.

Teacher(s)

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

Timetable

Wed 10:00–11:50 Virtuální místnost

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.

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.
• 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 a standard lecture. Lectures are oriented on the presentation of various solving methods for different types of scheduling problems. Lectures include exercises to practice studied methods. A comprehensive list of exercises related to the subject covers all studied areas and allows self-study.
For each lecture, a video is available in advance. A list of questions is also available. During the lecture, we will go together through the list of questions that basically constitute the lecture.

Assessment methods

There is the following expected evaluation given as a sum of points for homeworks and final written 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 2 bonus points 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). It is possible to get up to about 24 bonus points based on the number of lectures.
The final examination will be adjusted to the form of the online exam and to the number of enrolled students. In the case of a smaller number of students, the online oral exam will be completed, otherwise, a written exam will be done. The final written exam consists of about 7 examples and it is possible to get up to 80 points. It is necessary to get 40 out of 80 points at least. The 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

The course is taught annually.

Teacher's information

https://is.muni.cz/el/fi/jaro2021/PA167/index.qwarp

PA167 Scheduling

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. 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

Timetable

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.

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.
• 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 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

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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 21. 2. to Thu 16. 5. Thu 12:00–13:50 A320

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 24 fields of study the course is directly associated with, display

Course objectives

Course provides information about various types of scheduling problems from theoretical and especially practical perspective, it demonstrates general solution approaches for scheduling problems and the most important approaches for specific practical scheduling problems.

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.

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 following expected evaluation given as a sum of points for homeworks and final written exam: A 90 and more, B 80-89, C 70-79, D 60-69, E 50-59.
There are two homeworks during a 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.
Final written exam consists of about 7 examples and it is possible to get up to 80 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

Tue 12:00–13:50 A319

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 24 fields of study the course is directly associated with, display

Course objectives

Course provides information about various types of scheduling problems from theoretical and especially practical perspective, it demonstrates general solution approaches for scheduling problems and the most important approaches for specific practical scheduling problems.

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.

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 following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 60-69.
There are two homeworks during a 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.
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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

Tue 10:00–11:50 C511

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 24 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 following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 60-69.
There are two homeworks during a 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.
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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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. Vlastislav Dohnal, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 8:00–9:50 G126

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, 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

Final written exam (about 9 examples, 100 points). There is following evaluation A 90 and more, B 80-89, C 70-79, D 60-69, E 55-59. 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.
Bonus examples are available on random lectures, only students taking a part in the lecture can send their solution to the teacher. It is possible to get points for correct or almost correct solution only. Each student is required to obtain bonus points for one task at least. Bonus points can be added to the final exam points to improve evaluation.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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. Vlastislav Dohnal, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 16:00–17: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 23 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, or educational timetabling.

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, beam search, 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, 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.

Assessment methods

No evaluation during the semester, only final written exam (9 questions, 100 points). There is following evaluation A 100-90, B 89-80, C 79-70, D 69-60, E 59-55. 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 the final written exam.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Luděk Matyska, CSc.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 12:00–13: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 23 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, or timetabling.

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, beam search, 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, university course timetabling.
• Workforce scheduling.
• Telecommunication planning.

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.

Assessment methods

No evaluation during the semester, only final written exam (9 questions, 100 points). There is following evaluation A 100-90, B 89-80, C 79-70, D 69-60, E 59-55. 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 new list of about 200 questions will be available as a source for the final written exam.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 12:00–13: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 22 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, or timetabling.

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, beam search, 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, university course timetabling.
• Workforce scheduling.
• Telecommunication planning.

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.

Assessment methods

No evaluation during the semester, only final written exam (9 questions, 100 points). There is following evaluation A 100-90, B 89-80, C 79-70, D 69-60, E 59-55. 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Tue 14:00–15:50 B011

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 22 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, or timetabling.

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, beam search, 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.
• Workforce scheduling.
• Telecommunication planning.

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.

Assessment methods

No evaluation during the semester, only final written exam (9 questions, 100 points). There is following evaluation A 100-90, B 89-80, C 79-70, D 69-60, E 59-55. 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 12:00–13: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 19 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, or timetabling.

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, beam search, 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.
• Workforce scheduling.
• Telecommunication planning.

Literature

• PINEDO, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005. Springer Series in Operations Research. info

Assessment methods

Examination consists of final written exam. 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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 10:00–11:50 X Datový projektor, Mon 10:00–11:50 B011

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 19 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, timetabling, workforce scheduling, or telecommunication planning.

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, beam search, 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.
• Workforce scheduling.
• Telecommunication planning.

Literature

• Pinedo, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005.

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, otázky: příklady (zadán problém, případně i metoda, cílem výpočet rozvrhu), srovnávací, algoritmy, pojmy.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 10:00–11:50 B204

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 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, timetabling, workforce scheduling, or telecommunication planning.

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, beam search, 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.
• Workforce scheduling.
• Telecommunication planning.

Literature

• Pinedo, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005.

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, otázky: příklady (zadán problém, případně i metoda, cílem výpočet rozvrhu), srovnávací, algoritmy, pojmy.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

Language of instruction

Czech

Further Comments

The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 10:00–11:50 B204

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 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving planning and scheduling problems are presented. Description of general purpose scheduling procedures gives the basic overview of solving methods. Various models for planning and scheduling in manufacturing and services are described and algorithms for their solution are presented. The models include real-life problems like project planning, scheduling assembly systems, timetabling, workforce scheduling, or telecommunication planning.

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, beam search, 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.
• Workforce scheduling.
• Telecommunication planning.

Literature

• Pinedo, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005.

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, otázky: příklady (zadán problém, případně i metoda, cílem výpočet rozvrhu), srovnávací, algoritmy, pojmy.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

The written exam for each regular date. It is a preparation for all students, it includes questions: computation of schedule for the given problem and possibly solving method, comparison of some approaches, algorithms, terminology and its explanation.
The oral exam in the same day as the written exam, preparation on individual questions, discussion about written exam.
Irregular dates as oral exam only.

Language of instruction

Czech

Further Comments

The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

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

prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics

Timetable

Tue 8:00–9:50 B204

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 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of scheduling from the theoretical and practical point of view. Both classical and new methods for solving scheduling problems are presented. Planning is also discussed, its relation and possible integration with scheduling is considered. Scheduling and planning are introduced as a constraint satisfaction problem along with corresponding models and algorithms. Solving of smaller examples and modelling of real-life problems is also shown.

Syllabus

• Basic description of scheduling and planning problems, problem examples.
• Classical scheduling, Graham classification, complexity. Selected problems of classical scheduling, models and algorithms: one machine, parallel machines, shop scheduling.
• Scheduling as a constraint satisfaction problem: models and constraint propagation algorithms.
• Planning, constraint satisfaction techniques for planning. Relation and integration of planning and scheduling.
• Case studies: school timetabling, scheduling for GRID computing, and others.

Literature

• BRUCKER, Peter. Scheduling algorithms. 2nd, rev. and enl. ed. Berlin: Springer, 1998, xii, 342 s. ISBN 3-540-64105-X. info
• BAPTISTE, Philippe, Claude LE PAPE and Wim NUIJTEN. Constraint-based scheduling :applying constraint programming to scheduling problems. Boston: Kluwer Academic Publishers, 2001, xii, 198 s. ISBN 0-7923-7408-8. info
• GHALLAB, Malik, Dana NAU and Paolo TRAVERSO. Automated Planning: Theory & Practice. Morgan Kaufmann, 2004. info
• PINEDO, Michael. Scheduling :theory, algorithms and systems. Englewood Cliffs: Prentice Hall, 1995, xiv, 378 s. ISBN 0-13-706757-7. info

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, srovnávací, algoritmy, pojmy, příklady.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

The written exam for each regular date. It is a preparation for all students, it includes about 5 questions: outline of certain part, comparison of some approaches, algorithms, terminology and its explanation, examples.
The oral exam in the same day as the written exam, preparation on individual questions, discussion about written exam.
Irregular dates as oral exam only.

Language of instruction

Czech

Further Comments

The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

PA167 Scheduling

The course is not taught in Spring 2016

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

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 24 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 following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 65-69.
There are two homeworks during a 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.
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.

Language of instruction

Czech

Follow-Up Courses

• PA163 Constraint programming

Further Comments

Study Materials
The course is taught annually.
The course is taught: every week.

Teacher's information

http://www.fi.muni.cz/~hanka/rozvrhovani

• Enrolment Statistics (recent)