We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst-case approximation guarantees for the local optima of such neighborhoods. The so-called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic-jump neighborhood decreases the approximation guarantee from 2 to 3/2.
- Combinatorial optimization
- Local search
- performance guarantee
Brueggemann, T., Hurink, J. L., Vredeveld, T., & Woeginger, G. (2011). Exponential size neighborhoods for makespan minimization scheduling. Naval research logistics, 58(8), 795-803. https://doi.org/10.1002/nav.20485