Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/2074/10949
DC FieldValueLanguage
dc.contributor.authorMahdavi, Iraj
dc.contributor.authorMahadevan, B
dc.date.accessioned2020-03-23T09:25:11Z-
dc.date.available2020-03-23T09:25:11Z-
dc.date.issued2008
dc.identifier.issn0736-5845
dc.identifier.urihttps://repository.iimb.ac.in/handle/2074/10949-
dc.description.abstractCell formation problem in CMS design has received the attention of researchers for more than three decades. However, use of sequence data for cell formation has been a least researched area. Sequence data provides valuable information about the flow patterns of various jobs in a manufacturing system. Therefore, it is only natural to expect that use of sequence data must result in not only identifying the part families and machine groups but also the layout (sequence) of the machines within each cell. Unfortunately, such an approach has not been taken in the past while solving CMS design problem using sequence data. In this paper, we fill this gap in the literature by developing an algorithm that not only identifies the cells but also the sequence of machines in the cells in a simultaneous fashion. The numerical computations of the algorithm with the available problems in the literature indicate the usefulness of the algorithm. Further, it also points to the untapped potential of such an approach to solve CMS design and layout problem using sequence data. (C) 2007 Elsevier Ltd. All rights reserved.
dc.publisherPergamon-Elsevier Science Ltd.
dc.subjectCMS Design
dc.subjectSequence Data
dc.subjectLayout Design
dc.titleCLASS: an algorithm for cellular manufacturing system and layout design using sequence data
dc.typeJournal Article
dc.identifier.doi10.1016/j.rcim.2007.07.011
dc.pages488-497p.
dc.vol.noVol.24-
dc.issue.noIss.3-
dc.journal.nameRobotics and Computer-Integrated Manufacturing
Appears in Collections:2000-2009
Show simple item record

Google ScholarTM

Check

Altmetric


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