4308133: C15 Supply Chain Management

back to overview
Semester:SS 17
Type:Module
Language:English
ECTS-Credits:6.0
Scheduled in semester:2
Semester Hours per Week / Contact Hours:40.0 L / 45.0 h
Self-directed study time:135.0 h

Module coordination/Lecturers

Curricula

Master's degree programme in Information Systems (01.09.2015)

Description

Short description
The course covers the fundamentals of supply chain management, so it focuses on the coordination of problems related to the provision of products and services and the flow of goods.

Topics

  • Demand forecasting
  • Process flow analysis
  • Service process management
  • Inventory management
  • Location planning
  • Production planning
  • Scheduling
  • Network management

Learning objectives
  • Students will know about the main concepts, theories, and methods in supply chain management.
  • In a business game, students will recognize and analyze typical coordination problems along the supply chain.
  • In exercises, students will use analytical methods like linear programming, dynamic programming, regression analysis, and exponential smoothing, and state-of-the-art algorithms and heuristics like Silver-Meal and Branch-and-Bound.
  • In case studies, students will use these methods to identify business problems, generate solutions, and compare their solutions in terms of quality and accuracy.

Methods
  • The module involves interactive lectures with exercises to integrate theoretical knowledge and practical skills.
  • Case studies are used to show how the course contents are related.
  • A business game is used to illustrate typical coordination problems along the supply chain.
  • The e-learning platform Moodle will be used throughout the course for the dissemination of course material and discussions.

Recommended previous knowledge
  • Students are expected to have basic knowledge and skills in operations management.

Compulsory reading
  • Chopra, S., & Meindl, P. (2012). Supply Chain Management: Strategy, Planning, and Operation (5th edition). Pearson: Edinburgh Gate et al.

Qualifications