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: Tuesday, March 12, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Torsten Mütze

Scheduling with few changes

In this talk we consider a family of scheduling problems where a sequence of assignments from jobs to machines --- or from tasks to processors, or from workers to resources --- has to be determined, with the goal of minimizing the costs incurred by the interplay between these assignments (“costs” can be money, time, and/or manpower). To account for the various practical requirements, we employ different objective functions that are all based on elementary combinatorial properties of the schedule matrix. We present simple and efficient algorithms to solve the corresponding optimization problems, and also hardness results where such algorithms most likely do not exist.

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