Abstract
The multiprocessor scheduling problem consists in scheduling a set of tasks with known processing times into a set of identical processors so as to minimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing problem. Computational results illustrating the effectiveness of this approach are reported and compared with those obtained by other heuristics. © Springer-Verlag 2004.
Cite
CITATION STYLE
Alvim, A. C. F., & Ribeiro, C. C. (2004). A hybrid bin-packing heuristic to multiprocessor scheduling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059, 1–13. https://doi.org/10.1007/978-3-540-24838-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
