Abstract
We consider the problem of scheduling a sequence of jobs to m parallel machines as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all the machines are alive, and the system should be maintained alive as long as possible. It is well known that any on-line deterministic algorithm for identical machines has a competitive ratio of at least m and that greedy is an m competitive algorithm. In contrast we design an on-line randomized algorithm which is Ö(√m) competitive and a matching lower bound of Ω(√m) for any online randomized algorithm. In the case where the jobs are polynomially related we design an optimal O(log m) competitive randomized algorithm and a matching tight lower bound for any on-line randomized algorithm. In fact, if F is the ratio between the largest job and the smallest job then our randomized algorithm is O(log F) competitive.
A sub-problem that we solve which is interesting by its own is the problem where the value of the optimal algorithm is known in advance. Here we show a deterministic (constant) 2- 1/m competitive algorithm. We also show that our algorithm is optimal for two, three and four machines and that no on-line deterministic algorithm can achieve a better competitive ratio than 1.75 for m ≥ 4 machines.
For related machines we show that there is no on-line algorithm, whose competitive ratio is a function of the number of machines. However, for the case where the value of the optimal assignment is known in advance, and for the case where jobs arrive in non increasing order, we show that the exact competitive ratio is m. We show a constant 2 competitive algorithm for the intersection of the above two cases, i.e. the value of the optimal assignment is known in advance and the jobs arrive in non increasing order.
Research supported in part by Allon Fellowship and by the Israel Science Foundation administered by the Israel Academy of Sciences.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. Better bounds for on-line scheduling. In Proc. 29th ACM Symp. on Theory of Computing, 1997. To appear.
N. Alon, J. Csirik, S. V. Sevastianov, A. P. A. Vestjens, and G. J. Woeginger. Online and off-line approximation algorithms for vector covering problems. In Proc. 4th European Symposium on Algorithms, LNCS. Springer, 1996.
J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th ACM Symposium on the Theory of Computing, pages 623–631, 1993.
S. F. Assmann. Problems in discrete applied mathematics. Technical report, Doctoral Dissertation, Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1983.
S. F. Assmann, D. S. Johnson, D. J. Kleitman, and J. Y.-T. Leung. On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5:502–525, 1984.
B. Awerbuch, Y. Azar, E. Grove, M. Kao, P. Krishnan, and J. Vitter. Load balancing in the l p norm. In Proc. 36th IEEE Symp. on Found. of Comp. Science, pages 383–391, 1995.
Y. Bartal, H. Karloff, and Y. Rabani. A better lower bound for on-line scheduling. Information Processing Letters 50:113–116, 1994.
Yair Bartal, Amos Fiat, Howard Karloff, and R. Vorha. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symp. on Theory of Computing, 1992.
P. Berman and M. Karpinski. A note on on-line load balancing for related machines. Unpublished notes.
A. Borodin and R. EI-Yaniv. On randomization in online computations. In Computational Complexity, 1997.
B. Chen, A. van Vliet, and G. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221–230, 1994.
J. Csirik, H. Kellerer, and G. Woeginger. The exact lpt-bound for maximizing the minimum completion time. Operations Research Letters, 11:281–287, 1992.
J. Csirik and V. Totik. On-line algorithms for a dual version of bin packing. Discr. Appl. Math., 21:163–167, 1988.
B. Deuermeyer, D. Friesen, and M. Langston. Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J. Discrete Methods, 3:190–196, 1982.
D. Friesen and B. Deuermeyer. Analysis of greedy solutions for a replacement part sequencing problem. Math. Oper. Res., 6:74–87, 1981.
G. Galambos and G. Woeginger. An on-line scheduling heuristic with better worst case ratio than graham's list scheduling. Siam Journal on Computing, 22(2):349–355, 1993.
M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.
R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.
R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:263–269, 1969.
D. Karger, S. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994.
R. J. Lipton and A. Tomkins. Online interval scheduling.In Proc. of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 302–311, 1994.
G. Woeginger. A polynomial time approximation scheme for maximizing the minimum machine completion time. Technical Report, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Epstein, L. (1997). On-line machine covering. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-63397-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63397-6
Online ISBN: 978-3-540-69536-3
eBook Packages: Springer Book Archive