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.
Schuurman, P., & Vredeveld, T. (2001). Performance guarantees of local search for multiprocessor scheduling (full version accepted for Informs Journal on Computing), In Karen Aardal and Bert Gerards (eds.): Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 2081, 370-382. https://doi.org/10.1007/3-540-45535-3_29