现代电子技术2025，Vol.48Issue(16)：55-60,6.DOI:10.16652/j.issn.1004-373x.2025.16.010
基于DSM的最小化总返工次数的活动排序问题研究
Research on activity sorting problem based on DSM for minimizing total rework times
马晓燕 1薛俭 1黄伟浩2
作者信息
- 1. 陕西科技大学,陕西 西安 710021
- 2. 西安交通大学,陕西 西安 710049
- 折叠
摘要
Abstract
In order to improve the efficiency of new product development and reduce the total rework times,the activity sorting problem for minimizing total rework times is researched by taking the design structure matrix(DSM)as a tool.By constructing an optimization model aimed at minimizing the rework times,two algorithms are proposed:exchange-based local search algorithm and insertion-based local search algorithm.The simulation experiments are conducted by randomly generating DSMs of different scales and densities to compare and analyze the performance of the algorithm.The experimental results show that both algorithms can significantly reduce the total rework times,and the insertion-based local search algorithm is superior to exchange-based local search algorithm in most cases.The proposed method can provide a feasible path for optimizing the new product development process.关键词
新产品开发/返工次数/活动排序/设计结构矩阵/耦合活动/局部搜索算法Key words
new product development/rework time/activity sorting/design structure matrix/coupling activity/local search algorithm分类
信息技术与安全科学引用本文复制引用
马晓燕,薛俭,黄伟浩..基于DSM的最小化总返工次数的活动排序问题研究[J].现代电子技术,2025,48(16):55-60,6.
