Massachusetts Institute of Technology
Product development timing and cost analysis using information flow modeling
Abstract
dc:description.abstractIn product development processes. coupled tasks are mutually dependent for information. and there is not a clear sequence in which these tasks should be performed. In this thesis we set to answer the following questions (I) what is the proper ordering in which the tasks should be started and (2) what is the appropriate degree of overlap or concurrency between coupled tasks. A mathematical model has been developed based on characterizing the information exchanged between tasks using the probability of change and impact. The probability of change captures the likelihood of the information changing over the course of performing a task and the impact represents the rework generated by a change in the task receiving the information. The model ( I ) estimates the probability of the process being completed as a function of time and (2) provides the average completion time and cost of the development effort for a given degree of concurrency and task sequencing. These results then provide the basis for determining the appropriate task sequence and degree of concurrency to minimize development time and cost. The model was tested in product development settings at Hewlett-Packard and at General Motors. In addition to the case studies, the model has been used to define a set of general rules for sequencing tasks over a wide range of product development situations.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Department of Mechanical Engineering
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 1999
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Carrascosa, Maria, 1968-
- Advisor dc:contributor.advisor
-
- Steven Eppinger and Daniel Whitney.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- 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.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/9406
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/9406