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, May 19, 2009, 12:15 pm

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

**Location**: OAT S15/S16/S17

**Speaker**: Marek Krčál (Charles Univ., Prague)

We design a 1.75-approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines, with the same processing time on either machine. (This is a special case of so-called restricted assignment, where the set of eligible machines can be arbitrary for each job.) We also show that even for this special case it is NP-hard to compute better than 1.5 approximation.

This is the first improvement of the approximation ratio 2 of Lenstra,
Shmoys, and Tardos
[Approximation algorithms for scheduling unrelated parallel machines,
*Math. Program.*, 46:259--271, 1990],
for any special case with unbounded number of machines. Our lower
bound yields the same ratio as their lower bound which works for
restricted assignment, and which is still the state-of-the-art lower
bound even for the most general case.

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

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