Abstract
It is well-known that the scheduling of concurrent tasks with precedence constraints in parallel systems in order to minimize the makespan is NP-complete. We study both the average effectiveness and the average efficiency of 27 heuristics and 7 simulated annealing algorithms used for the minimization of makespan. It is shown, by a computational experiment, that the simulated annealing algorithms are very effective compared with the heuristics, provided these algorithms converge. It turns out that some heuristics are quite effective on the average, and that the heuristics, provided they are used together, have a qualitative behavior not much worse than that of the simulated annealing and are much more efficient.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. L. Adam, K. M. Chandy, J. R. Dickson, “A Comparison of List Schedules for Parallel Processing Systems”, Comm. ACM, Vol. 17, pp. 685–690, 1974.
E. G. Coffman Jr., R. L. Graham, “Optimal Scheduling for Two-Processor Systems”, Acta Informatica Vol. 1, pp. 200–213, 1972.
E. G. Coffman Jr., Z. Lin, “On the Optimal Stochastic Scheduling of Out-Forests”, Operations Research, Vol. 40, Supp. No. 1, pp. S67–S75, Janvier 1992.
C. Coroyer, Z. Liu, “Effectiveness of Heuristics and Simulated Annealing for the Scheduling of Concurrent Tasks — An Empirical Comparison,” Rapport de Recherche INRIA, No. 1379, Jan. 1991.
R. L. Graham, “Bounds on Multiprocessing Timing Anomalies”, SIAM J. Appl. Math., Vol. 17, No. 2, pp. 416–429, 1969.
B. Hajek, “Cooling Schedules for Optimal Annealing”, Mathematics of Operations Research, Vol. 13, No. 2, may 1988.
B. Hajek, G. Sasaki, “Simulated Annealing — to cool or not”, Systems and Control Letters, Vol. 12, pp. 443–447, 1989.
Y. C. Hu, “Parallel Sequencing and Assembly Line Problems”, Operations Research, Vol. 9, 841–848, 1961.
S. Kirkpatrick, C. D. Gellat Jr., M. P. Vecchi, “Optimization by Simulated Annealing”, Science, Vol. 220, pp. 671–680, 1983.
P. J. M. van Laarhoven, E. H. L. Aarts, “Simulated Annealing: Theory and Applications”, D. Reidel Publishing Company, 1987.
J. K. Lenstra, A. H. G. Rinnooy Kan, “Complexity of Scheduling under Precedence Constraints”, Operations Research, Vol. 26, No. 1, pp. 22–35, 1978.
Z. Liu, “A Note on Graham's Bound.” Information Processing Letters, Vol. 36, pp. 1–5, 1990.
Z. Liu, J. Labetoulle, “A Heuristic Method for Loading and Scheduling Flexible Manufacturing Systems”, Proc. of the Intern. Conf. Control 88, London, IEE Conference Publication, No. 285, pp. 195–200, 1988.
C. V. Ramamoorthy, K. M. Chandy, M. J. Gonzalez Jr., “Optimal Scheduling Strategies in a Multiprocessor System”, IEEE Transactions on Computers, Vol. C-21, No. 2, pp. 137–146, 1972.
J. Ramanujam, F. Ercal, P. Sadayappan, “Task Allocation by Simulated Annealing”, Proceedings of the Third Intern. Conf. on Supercomputing, Vol 3, 471–480, 1988.
F. B. Talbot, J. H. Patterson, W. V. Gehrlein, “A Comparative Evaluation of Heuristic Line Balancing Techniques”, Management Science, Vol. 32, No. 4, pp. 430–454, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coroyer, C., Liu, Z. (1993). Effectiveness of heuristics and simulated annealing for the scheduling of concurrent tasks — An empirical comparison. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_36
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive