Scheduling to Minimize Max Flow Time: Offline and Online Algorithms [chapter]

Monaldo Mastrolilli
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We investigate the max flow time scheduling problem in the off-line and on-line setting. We prove positive and negative theoretical results. In the off-line setting, we address the unrelated parallel machines model and present the first known fully polynomial time approximation scheme, when the number of machines is fixed. In the on-line setting and when the machines are identical, we analyze the First In First Out (FIFO) heuristic when preemption is allowed. We show that FIFO is an on-line
more &raquo; ... rithm with a (3 − 2/m)-competitive ratio. Finally, we present two lower bounds on the competitive ratio of deterministic on-line algorithms.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/978-3-540-45077-1_6</a> <a target="_blank" rel="external noopener" href="">fatcat:puoaltsfs5aj5k3oholllwmeym</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>