Machine grouping problem in cellular manufacturing systems— an integer programming approach

Abstract

In this paper a methodology is proposed to group the machines in cellular manufacturing systems based on the tooling requirements of the parts, toolings available on the machines and the processing times. Two 0-1 integer programming formulations are proposed. These formulations assume that the part families are known. The first formulation groups the machines based on the compatibility of parts with machines. The second formulation groups the machines in order to minimise the cost of allocating the machines and the cost of intercell movement. These formulations take into account the limitations on the number of machines in a group and the number of machines available of a particular type. The application of these formulations is illustrated using an example.