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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, December 05, 2006, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Justus Schwartz

We consider the scheduling formulation of the well known Santa Claus problem where $n$ processes have to be scheduled on $m$ machines without preemption. The goal is to maximize the minimum load. In our setting we assume that the expected processing time of each job is known, but the actual duration is determined after scheduling the jobs. We show that if the jobs have exponentially distributed processing times, and the ratio between the largest and the smallest expectation is at most $n/\log^3 n$, a simple greedy strategy has expected competitive ratio 1. On the other hand, we give an instance with ratio $n$ such that every algorithm has expected competitive ratio $\Omega(\sqrt{m})$.

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

Previous talks by year: 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