Part-machine grouping using weighted similarity coefficients

Authors:
B. Adenso-Díaz;S. Lozano;I. Eguía
Affiliations:
Escuela Superior de Ingenieros Industriales, Universidad de Oviedo, Campus de Viesques, 33204 Gijón, Spain;Escuela Superior de Ingenieros, Universidad de Sevilla, Camino de los Descubrimientos, s/n, 41092 Sevilla, Spain;Escuela Superior de Ingenieros, Universidad de Sevilla, Camino de los Descubrimientos, s/n, 41092 Sevilla, Spain
Venue:
Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Year:
2005

Citing 7
Cited 1

Relaxation methods for minimum cost ordinary and generalized network flow problems

Operations Research
Tabu search

Modern heuristic techniques for combinatorial problems
An extension to the p-median group technology algorithm

Computers and Operations Research
A tabu search approach to the cell formation problem

Computers and Industrial Engineering
Multiple criteria clustering algorithm for solving the group technology problem with multiple process routings

Computers and Industrial Engineering
Cell formation in group technology: review, evaluation and directions for future research

Computers and Industrial Engineering - Cellular manufacturing systems: design, analysis and implementation
Tabu Search

Tabu Search

Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first step in the transition to cellular manufacturing is part-machine grouping. In this paper, grouping parts into families and machines into cells is done in two phases: by first grouping machines and then assigning parts Limits both on the number of machines per cell and on the number of parts per family are considered. The number of cells is not fixed. A weighted sum of within-cell voids and out-of-cell operations is used to evaluate the part-machine grouping obtained. In Phase One, weighted similarity coefficients are computed and machines are clustered using a Tabu search algorithm. In Phase Two, part types are assigned to the previously formed groups using a linear minimum cost network flow model. The proposed approach is compared with three heuristics namely ZODIAC, GRAFICS and MST, on a large number of problems.