School of Technology and Computer Science Seminars
Parallel Machine Scheduling to Minimize Energy Consumption
by Gunjan Kumar (STCS, TIFR)
Friday, October 4, 2019
from
to
(Asia/Kolkata)
Description |
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 Q 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 (https://arxiv.org/abs/1909.13345). |
Organised by | Sayantan Chakraborty |