Results 1  10
of
19
Manufacturing Cell Design: An Integer Programming Model Employing Genetic Algorithms
 IIE Transactions
, 1996
"... The design of a cellular manufacturing system requires that a part population, at least minimally described by its use of process technology (part/machine incidence matrix), be partitioned into part families and that the associated plant equipment be partitioned into machine cells. At the highest le ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
(Show Context)
The design of a cellular manufacturing system requires that a part population, at least minimally described by its use of process technology (part/machine incidence matrix), be partitioned into part families and that the associated plant equipment be partitioned into machine cells. At the highest level, the objective is to form a set of completely autonomous units such that intercell movement of parts is minimized. We present an integer program that is solved using a genetic algorithm (GA) to assist in the design of cellular manufacturing systems. The formulation uses a unique representation scheme for individuals (part/machine partitions) that reduces the size of the cell formation problem and increases the scale of problems that can be solved. This approach offers improved design flexibility by allowing a variety of evaluation functions to be employed and by incorporating design constraints during cell formation. The effectiveness of the GA approach is demonstrated on several problems from the literature.
Grouping Components In Printed Circuit Board Assembly with Limited . . .
 INT. J. PROD. RES.
, 1997
"... ..."
An integrated formulation of manufacturing cell formation with capacity planning and routing
 Annals of Operations Research
, 1998
"... ..."
R.: An Indexed Model
 of Impredicative Polymorphism and Mutable References, January 2003, Available at http://www.cs.princeton.edu/ ∼ appel/papers/impred.pdf
"... A comparison of heuristic methods for ..."
Performance of Fuzzy ART neural network and hierarchical clustering
"... for part–machine grouping based on operation sequences ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
for part–machine grouping based on operation sequences
Minimization Subproblems and Heuristics for an Applied Clustering Problem
, 2001
"... A practical problem that requires the classification of a set of points of R^n using a criterion not sensitive to bounded outliers is studied in this paper. A fixedpoint (kmeans) algorithm is defined that uses an arbitrary distance function. Finite convergence is proved. A robust distance defined ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A practical problem that requires the classification of a set of points of R^n using a criterion not sensitive to bounded outliers is studied in this paper. A fixedpoint (kmeans) algorithm is defined that uses an arbitrary distance function. Finite convergence is proved. A robust distance defined by Boente, Fraiman and Yohai is selected for applications. Smooth approximations of this distance are defined and suitable heuristics are introduced to enhance the probability of finding global optimizers. A reallife example is presented and commented.
A hybrid Tabu Search Algorithm to Cell Formation Problem and its Variants
"... Abstract—Cell formation is the first step in the design of cellular manufacturing systems. In this study, a general purpose computational scheme employing a hybrid tabu search algorithm as the core is proposed to solve the cell formation problem and its variants. In the proposed scheme, great flexib ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Cell formation is the first step in the design of cellular manufacturing systems. In this study, a general purpose computational scheme employing a hybrid tabu search algorithm as the core is proposed to solve the cell formation problem and its variants. In the proposed scheme, great flexibilities are left to the users. The core solution searching algorithm embedded in the scheme can be easily changed to any other metaheuristic algorithms, such as the simulated annealing, genetic algorithm, etc., based on the characteristics of the problems to be solved or the preferences the users might have. In addition, several counters are designed to control the timing of conducting intensified solution searching and diversified solution searching strategies interactively. T Keywords—Cell formation problem, Tabu search
HEURISTIC BASED APPROACH OF CELL FORMATION CONSIDERING OPERATION SEQUENCE
, 2007
"... Abstract—This paper presents, a twostage heuristic based procedure for generating part family and machine cell formation in Cellular Manufacturing System. It decreases exceptional elements and voids which in turns decreases intercell flow of parts and increases utilization of machines in the cells. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—This paper presents, a twostage heuristic based procedure for generating part family and machine cell formation in Cellular Manufacturing System. It decreases exceptional elements and voids which in turns decreases intercell flow of parts and increases utilization of machines in the cells. In the first phase; the problem is solved as a bottomup aggregation procedure for machine grouping. Aggregation is based on the minimization of intercell flow. Later the parts are assigned to the cells according to the proposed heuristic. Upper bound on the cell size is imposed in the first stage which is relaxed gradually in second phase. It ensures the natural cell formation. The solution obtained at the end of first stage is refined in the second phase. Numerical examples were tested for grouping efficiency, grouping efficacy, global efficiency and have been compared with results reported by other researchers. The computational results are encouraging Index Terms — cellular manufacturing systems, part grouping, intercell movement, operation sequence, void, exceptional element
Annals of Operations Research 65(1996)3554 35 Manufacturing cell formation by statespace search*
"... This paper addresses the problem of grouping machines in order to design cellular manufacturing ceils, with an objective to minimize intercell flow. This problem is related to one of the major aims of group technology (GT): to decompose the manufacturing system into manufacturing cells that are as ..."
Abstract
 Add to MetaCart
(Show Context)
This paper addresses the problem of grouping machines in order to design cellular manufacturing ceils, with an objective to minimize intercell flow. This problem is related to one of the major aims of group technology (GT): to decompose the manufacturing system into manufacturing cells that are as independent as possible. This problem is NPhard. Thus, nonheuristic methods cannot address problems of typical industrial dimensions because they would require exorbitant amounts of computing time, while fast heuristic methods may suffer from poor solution quality. We present a branchandbound statespace search algorithm that attempts to overcome both these deficiencies. One of the major strengths of this algorithm is its efficient branching and search strategy. In addition, the algorithm employs the fast InterCell Traffic Minimization Method to provide good upper bounds, and computes lower bounds based on a relaxation of merging.