PA167 Scheduling

Faculty of Informatics
Spring 2012
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
Further Comments
Study Materials
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/~hanka/rozvrhovani
The course is also listed under the following terms Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2013, Spring 2014, Spring 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.
  • Enrolment Statistics (Spring 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2012/PA167