The tool indexing problem is one of allocating tools to slots in a tool magazine so as to minimize the tool change time in automated machining. This problem has been widely studied in the literature. A genetic algorithm has been suggested in the literature to solve this problem, but its implementation is non-standard. In this paper we describe a permutation based genetic algorithm for the tool indexing problem and compare its performance with an existing genetic algorithm.