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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11–18 (2003)
Awerbuch, Azar, Leonardi, Regev.: Minimizing the flow time without migration. In: STOC: ACM Symposium on Theory of Computing (STOC) (1999)
Chekuri, Khanna, Zhu.: Algorithms for minimizing weighted flow time. In: STOC: ACM Symposium on Theory of Computing (STOC) (2001)
Garg, Kumar.: Minimizing average flow time on related machines. In: STOC: ACM Symposium on Theory of Computing (STOC) (2006)
Goel.: B. tech thesis. In: Computer Science and Engineering, IIT Delhi (2004)
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)
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)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110–119 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, N., Kumar, A. (2006). Better Algorithms for Minimizing Average Flow-Time on Related Machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_17
Download citation
DOI: https://doi.org/10.1007/11786986_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)