Minimizing busy time in multiple machine real-time scheduling

Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Scopus citations

Abstract

We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a release time, a due date, a processing time and demand for machine capacity. The goal is to schedule all of the jobs non-preemptively in their release-time-deadline windows, subject to machine capacity constraints, such that the total busy time of the machines is minimized. Our problem has important applications in power-aware scheduling, optical network design and unit commitment in power systems. Scheduling to minimize busy times is APX-hard already in the special case where all jobs have the same (unit) processing times and can be scheduled in a fixed time interval. Our main result is a 5-approximation algorithm for general instances. We extend this result to obtain an algorithm with the same approximation ratio for the problem of scheduling moldable jobs, that requires also to determine, for each job, one of several processing-time vs. demand configurations. Better bounds and exact algorithms are derived for several special cases, including proper interval graphs, intervals forming a clique and laminar families of intervals.

Original languageEnglish (US)
Title of host publication30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010
Pages169-180
Number of pages12
DOIs
StatePublished - Dec 1 2010
Externally publishedYes
Event30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 - Chennai, India
Duration: Dec 15 2010Dec 18 2010

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume8
ISSN (Print)1868-8969

Conference

Conference30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010
CountryIndia
CityChennai
Period12/15/1012/18/10

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Approximation algorithm
  • Busy time
  • Preemption
  • Real-time scheduling

Fingerprint Dive into the research topics of 'Minimizing busy time in multiple machine real-time scheduling'. Together they form a unique fingerprint.

Cite this