Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 12, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Torsten Mütze
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.
Automatic MiSe System Software Version 1.4803M | admin login