BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Approximation in Stochastic Scheduling - Nicole Megow (TU Berlin)
DTSTART:20150203T140000Z
DTEND:20150203T150000Z
UID:TALK56719@talks.cam.ac.uk
CONTACT:Felix Fischer
DESCRIPTION:Stochastic scheduling is concerned with scheduling problems in
  which job processing times are modeled as random variables with known pro
 bability distributions. The actual processing times are revealed only upon
  completion of the jobs. Such problems have been addressed since the 70s\,
  but only more recently approximation results were derived. We give an ove
 rview of results and methods for obtaining provably good scheduling polici
 es. This involves linear programming\, lower bounding techniques borrowed 
 from online scheduling\, and index-based dynamic allocation rules known fr
 om multi-armed bandit problems. We discuss open problems\, further researc
 h directions\, and possible connections to other areas.
LOCATION:MR5\, Centre for Mathematical Sciences\, Wilberforce Road\, Cambr
 idge
END:VEVENT
END:VCALENDAR