A graph partitioning procedure for machine assignment and cell formation in group technology†

A mathematical model and solution procedure for the group technology configuration problem—the grouping of individual machines into cells and the routing of components to machines within cells—and the flexibility of the approach to various environments is discussed.

Abstract

SUMMARY This paper proposes a mathematical model and solution procedure for the group technology configuration problem—the grouping of individual machines into cells and the routing of components to machines within cells. Costs of inventory, machine depreciation, machine setup and material handling are first incorporated into a mathematical programming formulation. The formulation is then divided into two subproblems to facilitate solution. A heuristic graph partitioning procedure is then proposed for each subproblem. The first subproblem assigns components to specific machines. The second subproblem groups machines into cells. An approach for determining economic batch sizes in this environment is also included. Examples are included and the flexibility of the approach to various environments is discussed. Notes †This material is based upon work supported by the National Science Foundation under Grant DMC-8544993.