Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract) (1996)
| Venue: | In Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, Springer-Verlag |
| Citations: | 10 - 5 self |
BibTeX
@INPROCEEDINGS{Möhring96schedulingjobs,
author = {Rolf H. Möhring and Markus W. Schäffter and Andreas S. Schulz},
title = {Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)},
booktitle = {In Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, Springer-Verlag},
year = {1996},
pages = {pages},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Rolf H. Mhring Markus W. Schffter Andreas S. Schulz Abstract In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple (2 \Gamma 1 m )-approximation algorithm for scheduling to minimize the makespan on identical parallel processors subject to series-parallel precedence constraints and both unit processing times and communication delays. This meets the best known performance guarantee for the same problem but without communication delays. For the same problem but with (non-trivial) release dates, arbitrary precedence constraints, arbitrary processing times and "locally small" communication delays we obtain a simple 7 3 -approximation algorithm compared with the involved ( 7 3 \Gamma 4 ...
