The indexing problem in automated machining environments aims to arrange tools in tool slots of a tool magazine for faster processing of jobs. This problem is called the indexing problem and has been widely studied in the literature. We present heuristics using Lin Kernighan neighborhood structures to solve the indexing problem. Two of the heuristics are local search heuristics and one is a tabu search heuristic. To the best of our knowledge this is one of the first implementations of tabu search on a Lin
Kernighan neighborhood structure.