Results 1 
7 of
7
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 15 (5 self)
 Add to MetaCart
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.
Constructive Genetic Algorithm for MachinePart Cell Formation
, 2000
"... This paper presents a new evolutionary approach to the machinepart cell formation (MPCF) problem, generally considered in manufacturing cell design, where a zeroone machinepart matrix must have its rows and columns moved to form machines and parts clusters. The Constructive Genetic Algorithm (CGA ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents a new evolutionary approach to the machinepart cell formation (MPCF) problem, generally considered in manufacturing cell design, where a zeroone machinepart matrix must have its rows and columns moved to form machines and parts clusters. The Constructive Genetic Algorithm (CGA) was proposed recently to solve clustering problems, and is applied here to the MPCF. The MPCF is modeled as a biobjective problem that guides the construction of feasible assignments of machines and parts to specify clusters, and provides evaluation of schemata and structures in a common basis. A particularly derived structure and schema representation considers Jaccard distances for binary strings. A variable size population is formed only by schemata, considered as building blocks for feasible solutions construction along the generations. Recombination gives population diversification, and local search mutation is applied to structures that represent feasible solutions. Experimental res...
A Hybrid Genetic Algorithm for Manufacturing Cell Formation
"... Cellular manufacturing emerged as a production strategy capable of solving the problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new approach fo ..."
Abstract
 Add to MetaCart
Cellular manufacturing emerged as a production strategy capable of solving the problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new approach for obtaining machine cells and product families. The approach combines a local search heuristic with a genetic algorithm. Computational experience with the algorithm on a set of group technology problems available in the literature is also presented. The approach produced solutions with a grouping efficacy that is at least as good as any results previously reported in literature and improved the grouping efficacy for 59 % of the problems. Keywords: Cellular Manufacturing; Group Technology; Genetic Algorithms; Random Keys AT&T Labs Research Technical Report TD5FE6RN, October 29, 2002.
www.elsevier.com/locate/dsw An evolutionary algorithm for manufacturing cell formation *
, 2003
"... Cellular manufacturing emerged as a production strategy capable of solving the certain problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new app ..."
Abstract
 Add to MetaCart
Cellular manufacturing emerged as a production strategy capable of solving the certain problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new approach for obtaining machine cells and product families. The approach combines a local search heuristic with a genetic algorithm. Computational experience with the algorithm on a set of group technology problems available in the literature is also presented. The approach produced solutions with a grouping efficacy that is at least as good as any results previously reported in literature and improved the grouping efficacy for 59 % of the problems. q 2004 Published by Elsevier Ltd.
unknown title
, 2003
"... www.elsevier.com/locate/dsw Similarity coefficient methods applied to the cell formation problem: a comparative investigation ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/dsw Similarity coefficient methods applied to the cell formation problem: a comparative investigation
(AIRO 2011 Conference) A Column Generation Heuristic for MachinePart Cell Formation
"... The MachinePart Cell Formation is the problem of creating manufacture cells aiming best production flow of manageable subsystems. Systems automation and control can be improved by the aggregation of similar parts into families, and machines into independent cells that completely manufactures famil ..."
Abstract
 Add to MetaCart
The MachinePart Cell Formation is the problem of creating manufacture cells aiming best production flow of manageable subsystems. Systems automation and control can be improved by the aggregation of similar parts into families, and machines into independent cells that completely manufactures families of parts. The objective of the problem is to form a given number of disjoint partsmachines groups in which products do not have to move from one cell to the other to be processed. This problem be viewed as a clustering problem, and can be modeled as a pmedian location problem. This paper presents a column generation approach to pmedian problem, adapted to produce feasible assignments of parts into families. A further heuristic step assigns machines to families of parts to form the manufacturing cells. Experimental tests were made using instances from the literature. The computational results obtained with the heuristic were as good as in the literature for the majority of the instances, and even better in some cases.