FI:PA167 Scheduling - Course Information
PA167 Scheduling
Faculty of InformaticsSpring 2006
- 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
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, D-IN)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
- 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
- Enrolment Statistics (Spring 2006, recent)
- Permalink: https://is.muni.cz/course/fi/spring2006/PA167