Part-machine grouping using weighted similarity coefficients

被引:16
作者
Adenso-Díaz, B
Lozano, S
Eguía, I
机构
[1] Univ Sevilla, Escuela Super Ingn, Seville 41092, Spain
[2] Univ Oviedo, Escuela Super Ingn Ind, Gijon 33204, Spain
关键词
cellular manufacturing; similarity coefficients; tabu search; network flow;
D O I
10.1016/j.cie.2003.03.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:553 / 570
页数:18
相关论文
共 60 条
[1]   A tabu search approach to the cell formation problem [J].
Aljaber, N ;
Baek, W ;
Chen, CL .
COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (01) :169-185
[2]   A hard clustering approach to the part family formation problem [J].
AlSultan, KS .
PRODUCTION PLANNING & CONTROL, 1997, 8 (03) :231-236
[3]   A genetic algorithm for the part family formation problem [J].
AlSultan, KS ;
Fedjki, CA .
PRODUCTION PLANNING & CONTROL, 1997, 8 (08) :788-796
[4]   A HAMILTONIAN PATH APPROACH TO REORDERING THE PART-MACHINE MATRIX FOR CELLULAR MANUFACTURING [J].
ASKIN, RG ;
CRESSWELL, SH ;
GOLDBERG, JB ;
VAKHARIA, AJ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (06) :1081-1100
[5]   Manufacturing cell formation using similarity coefficients and pair-wise interchange: Formulation and comparison [J].
Balakrishnan, J .
PRODUCTION PLANNING & CONTROL, 1996, 7 (01) :11-21
[6]   AN EXTENSION TO THE P-MEDIAN GROUP TECHNOLOGY ALGORITHM [J].
BENARIEH, D ;
CHANG, PT .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (02) :119-125
[7]   RELAXATION METHODS FOR MINIMUM COST ORDINARY AND GENERALIZED NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP ;
TSENG, P .
OPERATIONS RESEARCH, 1988, 36 (01) :93-114
[8]   Grouping PCBs for set-up reduction: A maximum spanning tree approach [J].
Bhaskar, G ;
Narendran, TT .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (03) :621-632
[9]   A LINEAR FORMULATION OF THE MACHINE-PART CELL-FORMATION PROBLEM [J].
BOCTOR, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (02) :343-356
[10]   GROUPABILITY - AN ANALYSIS OF THE PROPERTIES OF BINARY DATA MATRICES FOR GROUP TECHNOLOGY [J].
CHANDRASEKHARAN, MP ;
RAJAGOPALAN, R .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1989, 27 (06) :1035-1052