Campus Event Calendar
Event Entry
What and Who
Scheduling problems on two sets of identical machines
Csanad Imreh
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 19 November 2001
13:30
30 Minutes
46.1 - MPII
024
Saarbrücken
Abstract
The following scheduling model is investigated. We have two sets of
identical machines, each job has two processing times one for each
set of machines. The goal is to minimize the sum of the makespans.
Both offline and online algorithms will be presented.
Contact
Hannah Bast
--email hidden
passcode not visible
logged in users only