Formation of Manufacturing Cells: An Algorithm for Minimizing the Inter-Cell Traffic.

Simple item page
dc.contributor.authorHarhalakis, Georgeen_US
dc.contributor.authorHilger, Jeanen_US
dc.contributor.authorNagi, R.en_US
dc.contributor.authorProth, Jean-Marieen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:44:00Z
dc.date.available2007-05-23T09:44:00Z
dc.date.issued1989en_US
dc.description.abstractIn this paper, we propose a parametrized algorithm to decompose a manufacturing system into manufacturing cells. The objective is to minimize the inter-cell traffic. The algorithm is based on a proximiq index defined between any two machines and which is conversely proportional to the intensity of the traffic between these machines. We compute a density for each machine. This densiq is defined as the number of machines close to the considered machine in the sense of the previous index. We then group into cells the machines that are in the same high density domains. We finally associate a family of parts to each of the previous cells. A numerical example illustrates this approachen_US
dc.format.extent484738 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4906
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1989-66en_US
dc.titleFormation of Manufacturing Cells: An Algorithm for Minimizing the Inter-Cell Traffic.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_89-66.pdf
Size:
473.38 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports