Skip to main content
Article thumbnail
Location of Repository

On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm

By Christoph Ambühl and Monaldo Mastrolilli

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 jobs one by one in the order they are released, we prove that there is no randomized on-line algorithm with a better competitive ratio. Finally, we investigate the non-preemptive case and show that the First In First Out heuristic achieves the best possible competitive ratio when m = 2

Topics: Scheduling, Preemption, On-line algorithms
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.4832
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.csc.liv.ac.uk/~chri... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.