Abstract
We study the problem of scheduling n jobs that arrive over time. We consider a non-preemptive setting on a single machine. The goal is to minimize the total flow time. We use extra resource competitive analysis: an optimal off-line algorithm which schedules jobs on a single machine is compared to a more powerful on-line algorithm that has l machines. We design an algorithm of competitive ratio O(min(Δ1/l, n 1/l)), where Δ is the maximum ratio between two job sizes, and provide a lower bound which shows that the algorithm is optimal up to a constant factor for any constant l. The algorithm works for a hard version of the problem where the sizes of the smallest and the largest jobs are not known in advance, only Δ is known. This gives a trade-off between the resource augmentation and the competitive ratio.
We also consider scheduling on parallel identical machines. In this case the optimal off-line algorithm has m machines and the on-line algorithm has Im machines. We give a lower bound for this case. Next, we give lower bounds for algorithms using resource augmentation on the speed. Finally, we consider scheduling with hard deadlines.
Work carried out while the author was at Tel-Aviv University.
Research supported by the Netherlands Organization for Scientific Research (NWO), project number SION 612-30-002.
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
B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 198–205, 1999.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
M. L. Dertouzos and A. K.-L. Mok. Multiprocessor on-line scheduling of hard-realtime tasks. IEEE Transactions on Software Engineering, 15:1497–1506, 1989.
A. Goel, M. R. Henzinger, S. Plotkin and E. Tardos. Scheduling Data Transfers in a Network and the Set Scheduling Problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999.
J.A. Hoogeveen and A.P.A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proc. 5th Int. Conf. Integer Programming and Combinatorial Optimization, LNCS, pages 404–414. Springer, 1996.
B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pages 214–221, 1995.
H. Kellerer, T. Tautenhahn, and G.J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proc. 28th ACM Symposium on the Theory of Computing, pages 418–426, 1996.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proc. 29th ACM Symposium on the Theory of Computing, pages 110–119, 1997.
Cynthia A. Philips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 140–149, 1997.
A.P.A. Vestjens. On-line Machine Scheduling PhD thesis, Technical University Eindhoven, 1997.
A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 12th ACM Symposium on Theory of Computing, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., van Stee, R. (2001). Optimal Online Flow Time with Resource Augmentation. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_54
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive