2026-09-21T23:37:42Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/96002021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Steven D. Eppinger.
Gutierrez, Carlos Iñaki
Massachusetts Institute of Technology. Department of Mechanical Engineering
2005-08-19T18:50:08Z
2005-08-19T18:50:08Z
1998
1998
http://hdl.handle.net/1721.1/9600
42202655
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1998.
Includes bibliographical references (leaves 88-90).
Successful product development efforts are greatly facilitated through the use of integration analysis. Teams working on a product development project need to be brought together into clusters to address interactions between the functions or product elements they represent. This thesis presents a stochastic clustering algorithm to find such clusters in an efficient manner. The algorithm can find clustering solutions to architecture and organization interaction problems modeled using the design structure matrix method. The algorithm can be controlled to favor solutions with certain characteristics such as level of overlap, number of clusters, maximum number of teams per cluster, and emphasis on the level of interactions addressed by the clusters. The difficulty to co-locate teams is measured by a coordination cost, which varies according to the composition of clusters. A mathematical model that minimizes the coordination cost to find the optimal solution for a given number of clusters has been developed. It has been used to measure the performance of the algorithm through a series of comparison tests. When the algorithm is run several times, the best solutions are reasonably close to an optimal solution. As a sample application, the algorithm is used to analyze the architecture of an automotive cockpit system according to six dimensions of integration. A set of solutions with different number of clusters was generated.
by Carlos Iñaki Gutierrez Fernandez.
S.M.
120 leaves
9552191 bytes
9551951 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Mechanical Engineering
Integration analysis of product architecture to support effective team co-location
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="94e9392e-b13e-40f5-b152-2f61eb4a6934">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Integration analysis of product architecture to support effective team co-location</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1998</PublicationDate>
<Authors>
<Author>
<DisplayName>Gutierrez, Carlos Iñaki</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mechanical Engineering</Keyword>
<Abstract>Successful product development efforts are greatly facilitated through the use of integration analysis. Teams working on a product development project need to be brought together into clusters to address interactions between the functions or product elements they represent. This thesis presents a stochastic clustering algorithm to find such clusters in an efficient manner. The algorithm can find clustering solutions to architecture and organization interaction problems modeled using the design structure matrix method. The algorithm can be controlled to favor solutions with certain characteristics such as level of overlap, number of clusters, maximum number of teams per cluster, and emphasis on the level of interactions addressed by the clusters. The difficulty to co-locate teams is measured by a coordination cost, which varies according to the composition of clusters. A mathematical model that minimizes the coordination cost to find the optimal solution for a given number of clusters has been developed. It has been used to measure the performance of the algorithm through a series of comparison tests. When the algorithm is run several times, the best solutions are reasonably close to an optimal solution. As a sample application, the algorithm is used to analyze the architecture of an automotive cockpit system according to six dimensions of integration. A set of solutions with different number of clusters was generated.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>