z-logo
Premium
Dynamic Programming for QFD Optimization
Author(s) -
Lai X.,
Xie M.,
Tan K. C.
Publication year - 2005
Publication title -
quality and reliability engineering international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 62
eISSN - 1099-1638
pISSN - 0748-8017
DOI - 10.1002/qre.685
Subject(s) - quality function deployment , computer science , dynamic programming , process (computing) , quality (philosophy) , resource (disambiguation) , product (mathematics) , mathematical optimization , function (biology) , operations research , industrial engineering , engineering , operations management , value engineering , mathematics , algorithm , computer network , philosophy , geometry , epistemology , evolutionary biology , biology , operating system
Abstract Quality function deployment (QFD) is a useful method in product design and development and its aim is to improve the quality and to better meet customers' needs. Due to cost and other resource constraints, trade‐offs are always needed. Many optimization methods have been introduced into the QFD process to maximize customer satisfaction under certain constraints. However, current optimization methods sometimes cannot give practical optimal results and the data needed are hard or costly to get. To overcome these problems, this paper proposes a dynamic programming approach for the optimization problem. We first use an extended House of Quality to gather more information. Next, limited resources are allocated to the technical attributes using dynamic programming. The value of each technical attribute can be determined according to the resources allocated to them. Compared with other optimization methods, the dynamic programming method requires less information and the optimal results are more relevant. Copyright © 2005 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here