0
Technical Briefs

Product Development Task Planning Using Worth Flow Analysis

[+] Author and Article Information
Toshiharu Miwa

Production Engineering Research Laboratory, Hitachi, Ltd., Yokohama 244-0817, Japan

Kosuke Ishii

Department of Mechanical Engineering, Design Group, Stanford University, Stanford, CA 94305

J. Comput. Inf. Sci. Eng 9(3), 034502 (Aug 04, 2009) (5 pages) doi:10.1115/1.3184589 History: Received October 19, 2007; Revised December 27, 2008; Published August 04, 2009

The acceleration of the product development cycle continues to be a significant challenge for manufacturing enterprises around the world. This paper describes a task planning method that minimizes the number of trial and error to reduce the development time for large-scale and complex products at the early stage of product development. The proposed method matches groups of product components and determines the development sequence for each component to minimize the amount of feedback information required across task groups. The method provides, as evaluation indices for task prioritization, the product-sum of engineering interaction among components and worth of each component, which the authors define as the “worth flow.” A generic hair dryer with simple mechanical structure serves as an example, illustrating that the proposed method contributes to the reduction in the amount of information required for setting the interface links by 65% compared with the conventional planning methods.

FIGURES IN THIS ARTICLE
<>
Copyright © 2009 by American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Figure 1

Problems of the chain reaction in the large and complex product development

Grahic Jump Location
Figure 2

Example of the proposed task planning algorithm

Grahic Jump Location
Figure 3

QFD-II: Relationship between product functions and components

Grahic Jump Location
Figure 4

Design structure matrix of the hair dryer

Grahic Jump Location
Figure 5

Result of proposed task planning algorithm

Grahic Jump Location
Figure 6

Comparison of the proposed algorithm with the previous algorithms

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In