This paper considers the problems of scheduling N jobs of the same family, each manufactured in a number of operations, in order, on three CNC machining centres which are equipped with automatic tool changers. A generalized procedure to minimize tool changeovers has been developed and tested on real industrial problems considering a set of possible constraints. The procedure suggested in this paper results in minimal changeovers. Validity of the heuristics suggested is borne out of the fact that when the same case-problem is considered as a Travelling Salesman problem and solved using Hungarian Method, identical result is attained. The procedure is simple and easy to implement in a CNC environment.