Online Scheduling of Splittable Tasks

Leah Epstein, Rob van Stee

Research output: Contribution to journalConference articlepeer-review


We consider online scheduling ofsplittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independently. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms which allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines we also improve upon the natural greedy algorithm in other classes of cases.

Original languageEnglish
JournalDagstuhl Seminar Proceedings
StatePublished - 2005
Externally publishedYes
EventAlgorithms for Optimization with Incomplete Information 2005 - Wadern, Germany
Duration: 16 Jan 200521 Jan 2005

Bibliographical note

Publisher Copyright:
© 2005 Dagstuhl Seminar Proceedings. All rights reserved.

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'Online Scheduling of Splittable Tasks'. Together they form a unique fingerprint.

Cite this