基于DSM的最小化总返工次数的活动排序问题研究

打开文本图片集

中图分类号：TN915.1-34 文献标识码：A 文章编号：1004-373X（2025）16-0055-06

DOI：10.16652/j.issn.1004-373x.2025.16.010

Research on activity sorting problem based on DSM for minimizing total rework times

MAXiaoyan1，XUEJian1，HUANGWeihao² （1.Shaanxi UniversityofScienceand Technology，Xi'an71oo21，China; 2.Xi'anJiaotongUniversity，Xi'an710o49，China）

Abstract：Inorder toimprove theeficiencyofnewproduct developmentandreduce thetotalrework times，theactivity sortingproblemforminimizingtotalreworktimesisresearchedbytakingthedesignstructurematrix（DSM）asatool.By constructinganoptimizationmodelaimedat minimizing therework times，twoalgorithmsare proposed：exchange-based local searchalgorithmand insertion-basedlocal searchalgorithm.Thesimulationexperimentsareconductedbyrandomlygenerating DSMsof diferentscalesanddensitiestocompareandanalyze theperformanceof thealgorithm.Theexperimentalresults show thatbothalgorithmscansignificantlyreducethetotalreworktimes，ndtheinsertion-basedlocalsearchalgorithmissuperirto exchange-basedlocalsearchalgorithm inmostcases.Theproposed methodcanprovideafeasiblepath foroptimizing thenew product development process.

Keywords：newproductdevelopment;rework time;activitysorting;design structure matrix;couplingactivity;local search algorithm

0 引言

新产品开发是一个高度复杂且动态的过程，很多新产品开发项目通常涉及大量相互耦合的研发活动。（剩余9817字）