Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - A polymatroid optimization approach

Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich

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

2 Citations (Scopus)

Abstract

We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be formulated as a polymatroid optimization problem. We develop a novel divide-and-conquer technique for the polymatroid optimization problem and then apply it to each scheduling problem. We show that each scheduling problem can be solved in O(Tfeas(n)× log n) time by using our divide-and-conquer technique, where n is the number of jobs and O(T feas(n) denotes the time complexity of the corresponding feasible scheduling problem with n jobs. This approach yields faster algorithms for most of the scheduling problems discussed in this paper.

Original languageEnglish
Title of host publicationAlgorithms - ESA 2008 - 16th Annual European Symposium, Proceedings
Pages756-767
Number of pages12
DOIs
Publication statusPublished - 2008 Dec 24
Event16th Annual European Symposium on Algorithms, ESA 2008 - Karlsruhe, Germany
Duration: 2008 Sep 152008 Sep 17

Publication series

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

Other

Other16th Annual European Symposium on Algorithms, ESA 2008
CountryGermany
CityKarlsruhe
Period08/9/1508/9/17

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - A polymatroid optimization approach'. Together they form a unique fingerprint.

  • Cite this

    Shakhlevich, N. V., Shioura, A., & Strusevich, V. A. (2008). Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - A polymatroid optimization approach. In Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings (pp. 756-767). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5193 LNCS). https://doi.org/10.1007/978-3-540-87744-8-63