1. Aarts, E.H.L., Lenstra, J.K. (eds.): Local search in combinatorial optimization. John Wiley & Sons, Chichester (1997)
2. Ahuja, R.K., Özlem, E., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)
3. Brucker, P., Hurink, J.L., Werner, F.: Improving local search heuristics for some scheduling problems II. Discrete Applied Mathematics 72, 47–69 (1997)
4. Brueggemann, T., Hurink, J.L., Kern, W.: Quality of move-optimal schedules for minimizing total weighted completion time. Operations Research Letters 34, 583–590 (2006)
5. Brueggemann, T., Hurink, J.L., Vredeveld, T., Woeginger, G.J.: Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines, Tech. Report No. 1801, University of Twente, Dep. of Mathematical Sciences (2006)