Abstract
We give an O(Q)-approximation for minimizing average flow time on unrelated machines, where Q is the maximum number of different process times on a machine. Consequently, the ratio is O(logP/logε) if all process times are a power of ε. Here, P is the ratio of the maximum and minimum process time of a job.
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
Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: STOC 1999: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 198–205 (1999)
Baker, K.R.: Introduction to sequencing and scheduling. Wiley, Chichester (1974)
Bansal, N.: Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett. 33(3), 267–273 (2005)
Baptiste, P., Brucker, P., Chrobak, M., Dürr, C., Kravchenko, S.A., Sourd, F.: The complexity of mean flow time scheduling problems with release times. J. of Scheduling 10(2), 139–146 (2007)
Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 181–190. Springer, Heidelberg (2006)
Garg, N., Kumar, A.: Minimizing average flow time on related machines. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 730–738 (2006)
Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: FOCS 2007: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–613 (2007)
Garg, N., Kumar, A., Muralidhara, V.N.: Minimizing total flow-time: the unrelated case. In: ISAAC 2008: Proceedings of 19th International Symposium on Algorithms and Computation (2008)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC 1997: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 110–119 (1997)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73(6), 875–891 (2007)
Sitters, R.A.: Complexity of preemptive minsum scheduling on unrelated parallel machines. J. of Algorithms 57(1), 37–48 (2005)
Sitters, R.A.: Approximability of average completion time scheduling on unrelated machines. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 768–779. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sitters, R.A. (2009). Minimizing Average Flow Time on Unrelated Machines. In: Bampis, E., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2008. Lecture Notes in Computer Science, vol 5426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93980-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-93980-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93979-5
Online ISBN: 978-3-540-93980-1
eBook Packages: Computer ScienceComputer Science (R0)