Modulcode:	infPaS-01a
Englische Bezeichnung:	Planning and Scheduling
Modulverantwortliche(r):	Prof. Dr. Klaus Jansen
Turnus:	unregelmäßig (WS21/22 WS22/23)
Präsenzzeiten:	2V 2Ü
ECTS:	6
Workload:	30 Std. Vorlesung, 30 Std. Präsenzübung, 120 Std. Selbststudium
Dauer:	ein Semester
Modulkategorien:	BSc-Inf-WP (BSc Inf (21)) BSc-WInf-WP-WInf (BSc WInf (21)) WI (BSc Inf (15)) MSc-Inf-WP (MSc Inf (21)) 2F-MEd-Inf-WP (MEd-Hdl Inf (21)) 2F-MA-Inf-WP (2F-MA Inf (21)) MSc-WInf-WP-WInf (MSc WInf (21)) WI (MSc Inf (15)) WWi (MSc WInf (15))
Lehrsprache:	Englisch
Voraussetzungen:	Inf-Math-A Inf-Math-B infEAlg-01a

Kurzfassung:

The module deals with deterministic scheduling problems (also called process planning, machine scheduling or sequencing problems). Scheduling problems occur in many applications, e.g. in business administration, logistics, transportation or in healthcare.

A set of activities (jobs) has to be executed on a set of resources (processors or machines). The goal is to find an optimal schedule that minimises or maximises a given optimization criterion. The focus is on the classification and complexity of scheduling problems, mathematical methods as well as exact and approximation algorithms for solving scheduling problems.

Lernziele:

The students can

• model scheduling problems, basic algorithms and complexity.
• can analyze scheduling on a single machine: minmax criteria, weighted sum of completion times, weighted number of late jobs
• can analyze scheduling on parallel machines: minmax criteria, algorithm without and with preemptions.
• understand multi-operation models: open shop, flow shop, job shop.

Lehrinhalte:

• Scheduling problems, basic algorithms and complexity.
• Scheduling on a single machine: minmax criteria, weighted sum of completion times, weighted number of late jobs
• Scheduling on parallel machines: minmax criteria, algorithm without and with preemptions.
• Multi-operation models: open shop, flow shop, job shop.

Weitere Voraussetzungen:

Introduction to Algorithms, Mathematics A and B, or equivalent courses.

Prüfungsleistung:

Final exam at the end of the semester.

In order to be accepted for the exam you will have to show by the given deadlines your supervisor your successful individual work on all theoretical exercise series (except two).

Lehr- und Lernmethoden:

Verwendbarkeit:

Literatur:

Florian Jaehn and Erwin Pesch: Ablaufplanung Einführung in Scheduling, Springer.

Michael Pinedo: Planning and Scheduling in Manufacturing and Services, Springer Publishing.

Verweise:

Kommentar: