Campus Event Calendar
Event Entry
What and Who
Parallel Machine Scheduling to Minimize Energy Consumption
Antonios Antoniadis
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 5 March 2020
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed. Machines can enter a sleep state and they consume no energy in this state. Each machine requires L units of energy to awaken from the sleep state and in its active state the machine can process jobs and consumes a unit of energy per unit time. We allow for preemption and migration of jobs and provide the first constant approximation algorithm for this problem.
Joint work with Naveen Garg, Gunjan Kumar and Nikhil Kumar. Appeared at SODA’20.
Contact
Antonios Antoniadis
--email hidden
passcode not visible
logged in users only
Antonios Antoniadis, 02/27/2020 17:23 -- Created document.