Advertisement

Better Algorithms for Minimizing Average Flow-Time on Related Machines

  • Naveen Garg
  • Amit Kumar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4051)

Abstract

We consider the problem of minimising flow time on related machines and give an O(logP)-approximation algorithm for the offline case and an O(log2 P)-competitive algorithm for the online version. This improves upon the previous best bound of O(log2 P logS) on the competitive ratio. Here P is the ratio of the maximum to the minimum processing time of a job and S is the ratio of the maximum to the minimum speed of a machine.

Keywords

Integer Program Competitive Ratio Online Algorithm Total Processing Time Competitive Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11–18 (2003)Google Scholar
  2. 2.
    Awerbuch, Azar, Leonardi, Regev.: Minimizing the flow time without migration. In: STOC: ACM Symposium on Theory of Computing (STOC) (1999)Google Scholar
  3. 3.
    Chekuri, Khanna, Zhu.: Algorithms for minimizing weighted flow time. In: STOC: ACM Symposium on Theory of Computing (STOC) (2001)Google Scholar
  4. 4.
    Garg, Kumar.: Minimizing average flow time on related machines. In: STOC: ACM Symposium on Theory of Computing (STOC) (2006)Google Scholar
  5. 5.
    Goel.: B. tech thesis. In: Computer Science and Engineering, IIT Delhi (2004)Google Scholar
  6. 6.
    Goemans, M.X.: Improved approximation algorthims for scheduling with release dates. In: SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 591–598 (1997)Google Scholar
  7. 7.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Mathematics 5, 287–326 (1979)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110–119 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Naveen Garg
    • 1
  • Amit Kumar
    • 1
  1. 1.Indian Institute of Technology DelhiNew DelhiIndia

Personalised recommendations