Abstract
This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.
Cite
CITATION STYLE
APA
Schuurman, P., & Vredeveld, T. (2001). Performance guarantees of local search for multiprocessor scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 370–382). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free