KU Operations Strategy and Tactical Planning
Course Content
Aim of the course is to introduce students to problems arising in strategical and tactical operations management. They will learn traditional and recent approaches to address and solve these problems. Topics to be covered are:
- Graphs
- Minimal spanning tree and shortest path
- Location problems
- Assignment problems
- Assembly line balancing
- Cellular manufacturing
Methods used
- specialized exact methods (e.g. Kuhn's algorithm)
- generic exact methods Branch and bound
- mathematical programming formulation (LP, IP, MIP, ...) for use in standard solvers
- dedicated starting heuristics
- improvement heuristics, local search
- metaheuristics