Parallel machine scheduling to minimize energy consumption

Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

9 Citations (Scopus)

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
Original languageEnglish
Title of host publicationProceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages2758–2769
Publication statusPublished - 2020
Externally publishedYes
Event31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 - Hilton Salt Lake City Center, Salt Lake City, United States
Duration: 5 Jan 20208 Jan 2020
Conference number: 31

Conference

Conference31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020
Abbreviated titleSODA 2020
Country/TerritoryUnited States
CitySalt Lake City
Period5/01/208/01/20

Keywords

  • n/a OA procedure

Fingerprint

Dive into the research topics of 'Parallel machine scheduling to minimize energy consumption'. Together they form a unique fingerprint.

Cite this