Abstract
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 language | English |
|---|---|
| Journal | Dagstuhl Seminar Proceedings |
| Volume | 5031 |
| State | Published - 2005 |
| Externally published | Yes |
| Event | Algorithms for Optimization with Incomplete Information 2005 - Wadern, Germany Duration: 16 Jan 2005 → 21 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