Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Module MAT-59-11-M-7

Theory of Scheduling Problems (M, 9.0 LP)

Module Identification

Module Number Module Name CP (Effort)
MAT-59-11-M-7 Theory of Scheduling Problems 9.0 CP (270 h)

Basedata

CP, Effort 9.0 CP = 270 h
Position of the semester 1 Sem. in SuSe
Level [7] Master (Advanced)
Language [EN] English
Module Manager
Lecturers
Area of study [MAT-OPT] Optimisation
Reference course of study [MAT-88.105-SG] M.Sc. Mathematics
Livecycle-State [NORM] Active

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
4V+2U MAT-59-11-K-7
Theory of Scheduling Problems
P 84 h 186 h - - PL1 9.0 SuSe
  • About [MAT-59-11-K-7]: Title: "Theory of Scheduling Problems"; Presence-Time: 84 h; Self-Study: 186 h

Examination achievement PL1

  • Form of examination: oral examination (20-30 Min.)
  • Examination Frequency: each semester
  • Examination number: 86390 ("Theory of Scheduling Problems")

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

  • Classification of scheduling problems,
  • The link between scheduling and combinatorial optimization problems,
  • Single machine problems,
  • Parallel machines,
  • Job shop scheduling,
  • Due-date scheduling,
  • Time-Cost tradeoff Problems.

In the lecture and the exercise classes one of the topics listed above or a further research topic may be extensively discussed. Details are to be found in the information system KIS.

Competencies / intended learning achievements

Upon successful completion of this module, the students have gained a good overview on current mathematical methods to solve scheduling or processing problems. The latter are of great importance for the organization of operative processes and computer science. The students understand the mathematical background required for the methods used and they can critically assess the possibilities and limitations of the use of these methods. They are able to name and to prove the essential statements of the lecture as well as to classify and to explain the connections. In particular, they are able to outline the conditions and assumptions that are necessary for the validity of the statements.

By completing the given exercises, the students have developed a skilled, precise and independent handling of the terms, propositions and techniques taught in the lecture. In addition, they have learnt how to apply these techniques to new problems, analyze them and develop solution strategies.

Literature

  • P. Brucker: Scheduling Algorithms,
  • M. Pinedo: Scheduling-Theory,
  • V. Tanaev, W. Gordon, Y.M. Shafransky: Scheduling Theory: Single Stage Systems.

References to Module / Module Number [MAT-59-11-M-7]

Course of Study Section Choice/Obligation
[INF-88.79-SG] M.Sc. Computer Science Formal Fundamentals [WP] Compulsory Elective
Module-Pool Name
[MAT-52-MPOOL-7] Specialisation Mathematical Optimisation (M.Sc.)
[MAT-AM-MPOOL-7] Applied Mathematics (Advanced Modules M.Sc.)