DSpace@nitr >
National Institue of Technology- Rourkela >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/660

Full metadata record

DC FieldValueLanguage
contributor.authorSudhakarapandian, R-
contributor.authorMahapatra, S S-
date.accessioned2008-04-20T05:22:43Z-
date.available2008-04-20T05:22:43Z-
date.issued2008-
identifier.citationInternational Journal of Services and Operations Management, Vol 4, Iss 5, P 618-630en
identifier.urihttp://hdl.handle.net/2080/660-
descriptionCopyright for the paper belongs to Inderscienceen
description.abstractIn Cell Formation Problem (CFP), the zero-one Part-Machine Incidence Matrix (PMIM) is the common input to any clustering algorithm. The output is generated with two or more machine cells and corresponding part families. The major demerit with such models is that real-life production factors such as operation time, sequence of operations and lot size of the product are not accounted for. In this paper, the operation sequence of the parts is considered to enhance the quality of the solution. A neural network-based algorithm is proposed to solve the CFP. The performance of the proposed algorithm is tested with example problems and the results are compared with the existing methods found in the literature. The results presented clearly shows that the performance of the proposed ART1-based algorithm is comparable with the other methods.en
format.extent370816 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherInderscienceen
subjectCell Formationen
subjectCFen
subjectART1en
subjectGrouping Efficiencyen
titleCell formation with ordinal-level data using ART1-based neural networksen
typeArticleen
Appears in Collections:Journal Articles

Files in This Item:

File Description SizeFormat
ssm-sudha-2008.pdf362KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback