Paper Info
Title
Parallel Machine Scheduling to Minimize Energy Consumption.
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.
Year
DOI
Venue
2020
10.5555/3381089.3381257
SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020
Field
DocType
Citations 
Discrete mathematics,Mathematical optimization,Machine scheduling,Computer science,Energy consumption
Conference
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Antonios Antoniadis112713.81
Naveen Garg22181178.27
Gunjan Kumar331.41
Nikhil Kumar400.68