Results 1  10
of
10
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.
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 Vector Perturbation Approach To The Generalized Aircraft Spare Parts Grouping Problem
, 2000
"... : The Vector Perturbation Approach is introduced for addressing the generalized parts grouping problem, identifying part families for a general set of suppliers, not just a single supplier. This method is driven by the need for flexible and lean supply chain systems. A vector space model is used to ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
: The Vector Perturbation Approach is introduced for addressing the generalized parts grouping problem, identifying part families for a general set of suppliers, not just a single supplier. This method is driven by the need for flexible and lean supply chain systems. A vector space model is used to represent a set of operation sequences as opposed to the traditional matrix and integer programming models in Group Technology. Using this approach we find that we are able to generate part groups from 90% of the available parts, in which all the operation sequences are preserved. This contrasts with only 66% of the available parts grouped using the traditional methods. Furthermore, a vector representation of operation sequences provides an intuitive means for discovering the natural structure of the part data. From these results we conclude that this technique can dramatically improve the effectiveness of the entire supply chain. INTRODUCTION A key challenge to military readiness is the a...
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.
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
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
MANUFACTURING CELL DESIGN WITH REDUCTION IN SETUP TIME THROUGH GENETIC ALGORITHM
"... 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 simultaneous arrangement of part families and machine cells for cellular manufacturing systems. The main feature of the proposed method is, the relevant production data such as process sequences and setup times are taken in to account. It has the ability to select the best solution among the solutions of compactness, group technology efficiency and reducing setup time efficiency for each part before attempting to cluster the machines and parts. The formation of part family and machine cell has been treated as a maximization problem according to a defined performance measure ‘β’. A genetic algorithm has been developed for solving the cell formation problem considering the reduction in setup time. The validation has been done based on a real time manufacturing data. This algorithm is written in the ‘C’ language on Intel Pentium / PIII compatible system.
Functional Analysis beyond Enrichment: NonRedundant Reciprocal Linkage of Genes and Biological Terms
, 2011
"... Functional analysis of large sets of genes and proteins is becoming more and more necessary with the increase of experimental biomolecular data at omicscale. Enrichment analysis is by far the most popular available methodology to derive functional implications of sets of cooperating genes. The prob ..."
Abstract
 Add to MetaCart
Functional analysis of large sets of genes and proteins is becoming more and more necessary with the increase of experimental biomolecular data at omicscale. Enrichment analysis is by far the most popular available methodology to derive functional implications of sets of cooperating genes. The problem with these techniques relies in the redundancy of resulting information, that in most cases generate lots of trivial results with high risk to mask the reality of key biological events. We present and describe a computational method, called GeneTerm Linker, that filters and links enriched output data identifying sets of associated genes and terms, producing metagroups of coherent biological significance. The method uses fuzzy reciprocal linkage between genes and terms to unravel their functional convergence and associations. The algorithm is tested with a small set of well known interacting proteins from yeast and with a large collection of reference sets from three heterogeneous resources: multiprotein complexes (CORUM), cellular pathways (SGD) and human diseases (OMIM). Statistical Precision, Recall and balanced Fscore are calculated showing robust results, even when different levels of random noise are included in the test sets. Although we could not find an equivalent method, we present a comparative analysis with a widely used method that combines enrichment and functional annotation clustering. A web application to use the method here proposed is provided at
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.
A New Combined Framework for the Cellular Manufacturing Systems Design
, 2008
"... Abstract — Cellular Manufacturing (CM) system has been recognized as an efficient and effective way to improve productivity in a factory. In recent years, there have been continuous research efforts to study different facet of CM system. The literature does not contain much published research on CM ..."
Abstract
 Add to MetaCart
Abstract — Cellular Manufacturing (CM) system has been recognized as an efficient and effective way to improve productivity in a factory. In recent years, there have been continuous research efforts to study different facet of CM system. The literature does not contain much published research on CM design which includes all design aspects. In this paper we provide a framework for the complete CM system design. It combines Axiomatic Design (AD) and Experimental Design (ED) to generate several feasible and potentially profitable designs. The AD approach is used as the basis for establishing a systematic CM systems design structure. ED has been a very useful tool to design and analyze complicated industrial design problems. AD helps secure valid inputfactors to the ED. An element of the proposed framework is desmontrate through a numerical example for cell formation with alternative process.
(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.