Abstract
We investigate the max flow scheduling problem in the off-line and on-line setting. We prove positive and negative theoretical results. In the off-line setting, we address the unrelated parallel machines model and present the first known fully polynomial time approximation scheme, when the number of machines is fixed. In the on-line setting and when the machines are identical, we analyze the First In First Out (FIFO) heuristic when preemption is allowed. We show that FIFO is an on-line algorithm with a (3-2/m)-competitive ratio. Finally, we present two lower bounds on the competitive ratio of deterministic on-line algorithms.
Supported by the “Metaheuristics Network”, grant HPRN-CT-1999-00106, and by Swiss National Science Foundation project 20-63733.00/1, “Resource Allocation and Scheduling in Flexible Manufacturing Systems”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC 1999), pp. 198–205 (1999)
Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 270–279 (1998)
Chen, B., Potts, C., Woeginger, G.: A review of machine scheduling: Complexity, algorithms and approximability. Handbook of Combinatorial Optimization 3, 21–169 (1998)
Fishkin, A., Jansen, K., Mastrolilli, M.: Grouping techniques for scheduling problems: simpler and faster. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 206–217. Springer, Heidelberg (2001)
Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey, vol. 5, pp. 287–326. North–Holland, Amsterdam (1979)
Hochbaum, D., Shmoys, D.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM 34, 144–162 (1987)
Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach. SIAM J. on Computing 17, 539–551 (1988)
Hong, K.S., Leung, J.Y.-T.: On-line scheduling of real-time tasks. IEEE Transactions on Computing 41, 1326–1331 (1992)
Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM 23(2), 317–327 (1976)
Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. In: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, pp. 408–417 (1999)
Karger, D., Stein, C., Wein, J.: Scheduling algorithms. In: Atallah, M.J. (ed.) Handbook of Algorithms and Theory of Computation. CRC Press, Boca Raton (1997)
Kellerer, H., Tautenhahn, T., Woeginger, G.J.: Approximability and nonapproximability results for minimizing total flow time on a single machine. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 418–426 (1996)
Labetoulle, J., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 245–261. Academic Press, London (1984)
Lawler, E., Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM 25, 612–619 (1978)
Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271 (1990)
Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: Proc. 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 110–119 (1997)
Sgall, J.: On-line scheduling – a survey. In: Fiat, A., Woeginger, G. (eds.) On-Line Algorithms, Lecture Notes in Computer Science, Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mastrolilli, M. (2003). Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive