IA267 Scheduling

Fakulta informatiky
jaro 2025
Rozsah
2/0. 2 kr. (plus ukončení). Ukončení: zk.
Vyučováno kontaktně
Vyučující
doc. Mgr. Hana Rudová, Ph.D. (přednášející)
Garance
doc. Mgr. Hana Rudová, Ph.D.
Katedra strojového učení a zpracování dat – Fakulta informatiky
Dodavatelské pracoviště: Katedra strojového učení a zpracování dat – Fakulta informatiky
Omezení zápisu do předmětu
Předmět je nabízen i studentům mimo mateřské obory.
Mateřské obory/plány
předmět má 30 mateřských oborů, zobrazit
Cíle předmětu
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.
Výstupy z učení
The graduate will be able to identify and describe various scheduling problems appearing in practice.
The graduate will be knowledgeable of scheduling problems in manufacturing, real-time systems, and services.
The graduate will be aware of algorithms and solution methods for project planning, scheduling in real-time systems, scheduling of flexible assembly systems, or educational timetabling.
The graduate will be able to solve scheduling problems with the help of studied algorithms and approaches.
Osnova
  • Introduction: examples, scheduling problem, Graham classification.
  • Machine scheduling: dispatching rules, branch&bound, mathematical programming.
  • Project planning: project representation, critical path, time/cost trade-offs, workforce constraints.
  • Shop scheduling: job-shop problem, disjunctive graph representation, branch&bound, shifting bottleneck, flexible assembly systems.
  • Real-time systems: introduction, reference model, off-line scheduling, static priority scheduling, dynamic priority scheduling, real-time operating systems.
  • Reservations and timetabling: interval scheduling, reservation with slack, workforce and tooling constraints, educational timetabling.
Literatura
  • PINEDO, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005. Springer Series in Operations Research. info
Výukové metody
The course is taught in the form of a standard lecture. Lectures are oriented on the presentation of various methods for different types of scheduling problems. Lectures include exercises to practice studied methods.
Metody hodnocení
The following expected evaluation is given as a sum of points for two written tests and 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 for 25 points. Each student is required to obtain 11 points at least from the intra-semester test.
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. 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.
Vyučovací jazyk
Angličtina
Informace učitele
https://is.muni.cz/el/fi/jaro2024/PA167/index.qwarp
Další komentáře
Předmět je vyučován každoročně.
Výuka probíhá každý týden.
  • Permalink: https://is.muni.cz/predmet/fi/jaro2025/IA267