On-line scheduling to minimize max flow time: an optimal preemptive algorithm

Abstract

We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the maximum flow time among all jobs, where the flow time of a job is its completion time minus its release time. We derive an on-line algorithm with competitive ratio 2 − 1/m. Moreover, when the algorithm must schedule… (More)
DOI: 10.1016/j.orl.2004.10.006

Topics

1 Figure or Table

Cite this paper

@article{Ambhl2005OnlineST, title={On-line scheduling to minimize max flow time: an optimal preemptive algorithm}, author={Christoph Amb{\"u}hl and Monaldo Mastrolilli}, journal={Oper. Res. Lett.}, year={2005}, volume={33}, pages={597-602} }