Campus Event Calendar
Event Entry
What and Who
Loss Minimization Scheduling for Generalizations of Interval Jobs
Danny Hermelin
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 24 April 2012
13:00
45 Minutes
E1 4
024
Saarbrücken
Abstract
In loss minimization scheduling, we are given a set of jobs (with costs), and the goal is to remove the smallest (cheapest) subset of jobs so that the remaining jobs can be feasibly scheduled. In the case where all jobs are simple intervals of execution time, loss minimization scheduling is classically known to be linear-time solvable. We examine some generalizations of this case which are NP-hard to solve optimally, and present efficient approximation algorithms for these generalizations.
Contact
Danny Hermelin
--email hidden
passcode not visible
logged in users only
Danny Hermelin, 04/23/2012 15:45
Danny Hermelin, 04/23/2012 15:45 -- Created document.
Danny Hermelin, 04/23/2012 15:45 -- Created document.