BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jannik Matuschke (KU Leuven)
DTSTART:20210525T174500Z
DTEND:20210525T181500Z
DTSTAMP:20260419T130453Z
UID:MIP2021/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/10/"
 >LP-based Approximation for Generalized Malleable Scheduling</a>\nby Janni
 k Matuschke (KU Leuven) as part of Mixed Integer Programming Workshop 2021
 \n\n\nAbstract\nIn malleable scheduling\, jobs can be executed simultaneou
 sly on multiple machines with the processing time depending on the number 
 of allocated machines. Each job is required to be executed non-preemptivel
 y and in unison\, i.e.\, it has to occupy the same time interval on all it
 s allocated machines. In this talk\, we discuss a generalization of mallea
 ble scheduling\, in which a function f(S\, j) determines the processing ti
 me of job j on machine subset S. Under different discrete concavity assump
 tions on 1/f(S\,j)\, we show that the scheduling problem can be approximat
 ed by a considerably simpler assignment problem and derive LP-based approx
 imation algorithms.\nThis is joint work with Dimitris Fotakis and Orestis 
 Papadigenopoulos.\n
LOCATION:https://researchseminars.org/talk/MIP2021/10/
END:VEVENT
END:VCALENDAR