License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.85
URN: urn:nbn:de:0030-drops-52964
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5296/
Bansal, Nikhil ;
Cloostermans, Bouke
Minimizing Maximum Flow-time on Related Machines
Abstract
We consider the online problem of minimizing the maximum flow-time on related machines. This is a natural generalization of the extensively studied makespan minimization problem to the setting where jobs arrive over time. Interestingly, natural algorithms such as Greedy or Slow-fit that work for the simpler identical machines case or for makespan minimization on related machines, are not O(1)-competitive. Our main result is a new O(1)-competitive algorithm for the problem. Previously, O(1)-competitive algorithms were known only with resource augmentation, and in fact no O(1) approximation was known even in the offline case.
BibTeX - Entry
@InProceedings{bansal_et_al:LIPIcs:2015:5296,
author = {Nikhil Bansal and Bouke Cloostermans},
title = {{Minimizing Maximum Flow-time on Related Machines}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
pages = {85--95},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-89-7},
ISSN = {1868-8969},
year = {2015},
volume = {40},
editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5296},
URN = {urn:nbn:de:0030-drops-52964},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.85},
annote = {Keywords: Related machines scheduling, Maximum flow-time minimization, On-line algorithm, Approximation algorithm}
}
Keywords: |
|
Related machines scheduling, Maximum flow-time minimization, On-line algorithm, Approximation algorithm |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
13.08.2015 |