Minimizing flow time on a constant number of machines with preemption

Minimizing flow time on a constant number of machines with preemption

0.00 Avg rating—0 Votes
Article ID: iaor20051759
Country: Netherlands
Volume: 33
Issue: 3
Start Page Number: 267
End Page Number: 273
Publication Date: May 2005
Journal: Operations Research Letters
Authors:
Keywords: combinatorial analysis
Abstract:

We consider offline algorithms for minimizing the total flow time on O(1) machines where jobs can be preempted arbitrarily but migrations are disallowed. Our main result is a quasi-polynomial time approximation scheme for minimizing the total flow time. We also consider more general settings and give some hardness results.

Reviews

Required fields are marked *. Your email address will not be published.