基于距离可达矩阵识别业务流程中的活动环的新方法  

DRM-Based Approach to Identifying Activity Loops in Business Process Reengineering

作　　者：原慧琳[1] 王雷震[1] 汪定伟[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2009年第10期1381-1384,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金重点资助项目(70431003);国家自然科学基金创新群体项目(60521003);国家科技支撑计划项目(2006BAH02A09)

摘　　要：在可达矩阵的基础上,提出了距离可达矩阵识别的新方法.该方法将距离值引入到可达矩阵中,从而可以直接显示出活动间的最短距离并在业务流程中快速地寻找不合理活动环.详细描述了该方法所涉及的定义及运算规则.算例表明该方法能快速方便地找到活动环、活动路径及最短距离,为业务流程再造提供了一种新的解决方案.A new approach named DRM （distance reachable matrix） was proposed by introducing the value of distance in the reachable matrix so as to show directly the shortest distance at intervals of activities and find out the unreasonable activity loops quickly in business process. The definition and operating rules of DRM and others related to DRM were described in detail. Numerical examples showed that the activity loops and routes and shortest distance were all found out quickly by the approach proposed, thus providing a new resolution for the BPR （business process reengineering）.

关 键 词：距离可达矩阵 活动环 最短距离 业务流程重组(BPR) 

分 类 号：TG335[金属学及工艺—金属压力加工]