Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 03, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Mathias Ermatinger

Generic Algorithms for Scheduling Problems with Changeover Costs

The topic of my master thesis were scheduling problems that involve changeover costs and that arise in several industrial applications such as mailroom insert planning, printed circuit board manufacturing and cutting tool management for CNC machines. In my thesis I implemented several algorithms to solve such problems, either optimally or approximately, and performed extensive experiments to evaluate the quality of these algorithms on large-scale real-world instances. The focus of this talk will be to show that two variants of the above scheduling problems can be solved by using algorithmic techniques that are well-known to computer-scientists, namely flow networks and the travelling salesman problem.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login