Grouping of parts and machines in presence of alternative process routes by genetic algorithm

This paper addresses generalized grouping problem where each part has more than one process route. The problem of simultaneously assigning machines and process routes (parts) to cells is formulated as an integer-programming problem. The objective of minimization of intercell movements is achieved by minimizing the number of visits to various cells required by a process route for processing the corresponding part. A procedure based on genetic algorithm is suggested as a solution methodology. The working of the proposed algorithm is illustrated with a numerical example and it is found that it can be a powerful tool for solving grouping problems.