Abstract
In this paper, we consider the classical two uniform machine scheduling problem. We present a compound algorithm which consists of three Greedy-like subprocedures running independently. We prove that the algorithm has a worst-case bound of 7/6 and runs in linear time.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Burkard, R. E., He, Y.: A note on multifit scheduling for uniform machines, SFB Report 116, 1997, Institut für Mathematik, TU Graz, Austria. Submitted for publication.
Friesen, D. K., Langston, M. A.: Analysis of a compound bin packing algorithm. SIAM J. Discr. Math.4, 61–79 (1991).
Gonzalez, T., Ibarra, O. H., Sahni, S.: Bounds for LPT scheduling on uniform processors. SIAM J. Comput.6, 155–166 (1977).
He, Y., Kellerer, H., Kotov, V.: Linear compound algorithms for the partitioning problem (submitted).
Hochbaum, D. S., Shmoys, D. B.: A polynomial approximation scheme for scheduling on uniform processors. Using the dual approximation approach, SIAM J. Comput.17, 539–551 (1988).
Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM23, 317–327 (1976).
Kohli, R., Krishnamurti, R.: Joint performance of greedy heuristic for the integer knapsack problem. Discr. Appl. Math.56, 37–48 (1995).
Kovalev, M. M., Kotov, V. M.: Evaluation of gradient algorithms for knapsack and travelling salesman problems. Report CORR 91-04, University of Waterloo, 1991.
Lai, T.-C.: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems, Oper, Res. Lett.14, 215–220 (1993).
Mireault, P., Orlin, J. B., Vohra, R. V.: A parametric worst case analysis of the LPT heuristic for two uniform machines, Oper. Res.45, 116–125 (1997).
Author information
Authors and Affiliations
Additional information
Partially supported by SFB F003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung and by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Burkard, R.E., He, Y. & Kellerer, H. A linear compound algorithm for uniform machine scheduling. Computing 61, 1–9 (1998). https://doi.org/10.1007/BF02684446
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684446