动态规划在产品家族替换策略中的应用

提出如何适时地选择和启动新模块以替代、更新产品家族中现有模块的系统算法.依据由模块更新引起的利润变化的独立性等假设,通过建立动态规划模型,将产品家族的优化问题分解为多个较小的模块组的子优化问题,并利用相互独立模块组的集合和模块群的概念,减小动态规划中所需的状态空间和计算空间.所提出的动态规划算法,依据整个产品家族和单个产品模块间的相互关系,最终实现了设定时间内产品家族的利润最大化.饮水机产品家族的实例表明,所提出的算法可以有效地优化产品家族构架.

Case Study for Product Family Replacement Strategies Based on Dynamic Programming

A case study of water dispensers is reported to explain a systematic methodology based on dynamics programming(DP),which is proposed to plan the launch timing of new modules that will replace the existing modules of an evolving product family(PF) architecture.The DP-based methodology proposed breaks up the PF module launch planning optimization problem into smaller DP optimization problems involving module groups based on the independence assumption of profit change due to module replacement strategies.The aggregation concepts of independent module groups and module clusters are used to decrease the state space and the calculation space in the DP model.The proposed methodology seeks to maximize the total profit of a PF for a given planning horizon by taking into account the interdependencies of modules at both the product level and the PF level.The case study of water dispensers PF demonstrates the effectiveness of the proposed methodology.