Course for international guest/part time students
- Faculty
- Faculty of Science
- Organization
- TTK Department of Operations Research
- Code
- utemel1u0um17em
- Title
- Scheduling theory (l)
- Usual semester
- Autumn
- Published semester
- 2026/27/1
- ECTS
- 3
- Language
- hu
- Learning outcomes
- Knowledge: getting familiar with the modern notions of scheduling theory Ability: to understand and use scheduling algorithms Attitude: the need to deepen the applied mathematical knowledge, to gain new applied mathematical skills, to develop competencies. Aspiration to apply the mathematical knowledge for a wide range of problems Autonomy and Responsibility: based on the gained knowledge in scheduling theory, the students are able to decide which tools are the most suitable to solve applied problems
- Course content
- Single-machine scheduling: sorting, dynamic programming, approximate solutions with LP-relaxation. Parallel and uniform machines: list scheduling, Hu's algorithm, precedence constraints, interruptible jobs. Shop models: scheduling with matchings, Johnson's algorithm. Branch and bound, bin packing.
- Assessment method
- exam