Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/438
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMahapatra, S S-
dc.contributor.authorSudhakarapandian, R-
dc.date.accessioned2007-06-14T08:27:52Z-
dc.date.available2007-06-14T08:27:52Z-
dc.date.issued2006-
dc.identifier.citationProceedings of the International Conference on Global Manufacturing and Innovation – July 27-29, 2006en
dc.identifier.urihttp://hdl.handle.net/2080/438-
dc.descriptionCopyright for the article belongs to the proceedings publisheren
dc.description.abstractCellular layout is a well-known solution method to the layout problems in modern batch type production industries. In Cellular manufacturing system (CMS), machines and parts are grouped together based on manufacturing similarities. Generally, zero-one machine-part incidence matrix (MPIM) obtained from the route sheet information is used to form machine cells. The major demerit with such approaches is that real life production factors cannot be accounted for. In an attempt to address generalized cell formation problem, this study considers operational time of the parts processed on each machine. An efficient algorithm based on Genetic Algorithm (GA) is suggested to form machine cells with the combined objective of minimizing total cell load variation and exceptional elements when workload matrix is presented as input. A new grouping efficiency measure called Modified Grouping Efficiency (MGE) is proposed to evaluate the performance of GA. The proposed algorithm is tested with varied sizes of problems from open literatureen
dc.format.extent185873 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.subjectCell Formationen
dc.subjectGenetic Algorithmen
dc.subjectGrouping Efficiencyen
dc.subjectARTIen
dc.titleA Metaheuristic Approach For Generalized Cell Formation with Ratio Level Dataen
dc.typeArticleen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
OR_06.pdf181.52 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.