Busy time scheduling on a bounded number of machines (Extended abstract)

Frederic Koehler, Samir Khuller

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

3 Scopus citations


In this paper we consider a basic scheduling problem called the busy time scheduling problem - given n jobs, with release times rj , deadlines dj and processing times pjand m machines, where each machine can run up to g jobs concurrently, our goal is to find a schedule to minimize the sum of the “on” times for the machines. We develop the first correct constant factor online competitive algorithm for the case when g is unbounded, and give a O(log P) approximation for general g, where P is the ratio of maximum to minimum processing time. When g is bounded, all prior busy time approximation algorithms use an unbounded number of machines; note it is NP-hard just to test feasibility on fixed m machines. For this problem we give both offline and online (requiring “lookahead”) algorithms, which are O(1) competitive in busy time and O(log P) competitive in number of machines used.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings
EditorsFaith Ellen, Antonina Kolokolova, Jorg-Rudiger Sack
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319621265
StatePublished - 2017
Event15th International Symposium on Algorithms and Data Structures, WADS 2017 - St. John’s, Canada
Duration: Jul 31 2017Aug 2 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10389 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Symposium on Algorithms and Data Structures, WADS 2017
CitySt. John’s

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Busy time scheduling on a bounded number of machines (Extended abstract)'. Together they form a unique fingerprint.

Cite this