首页 | 本学科首页   官方微博 | 高级检索  
     

经营过程结构优化的研究
引用本文:田春华,柴跃廷,刘义,任守榘. 经营过程结构优化的研究[J]. 计算机集成制造系统, 2004, 10(2): 157-165
作者姓名:田春华  柴跃廷  刘义  任守榘
作者单位:清华大学自动化系,北京,100084;清华大学自动化系,北京,100084;清华大学自动化系,北京,100084;清华大学自动化系,北京,100084
基金项目:国家863/CIMS主题资助项目(2001AA414250,2001AA414230),清华大学信息学院985项目(09110-9001)。~~
摘    要:实现某特定功能通常存在多种经营过程方案,讨论了如何从备选活动集中选择活动,构建费用最小的经营过程问题。该结构优化问题的决策变量采用了向量表示方法,建立0—1整数非线性规划模型,给出了可行解存在性的判定方法。在分枝定界数值算法中,采用了前向搜索策略,提出了定界算法,讨论了重复解的消除方法,并用示例说明了算法在减小搜索空间上的有效性。

关 键 词:经营过程  分枝定界法  经营过程设计
文章编号:1006-5911(2004)02-0157-08
修稿时间:2003-01-02

Business Process Structure Optimization
TIAN Chun-hua,CHAI Yue-ting,LIU Yi,REN Shou-ju. Business Process Structure Optimization[J]. Computer Integrated Manufacturing Systems, 2004, 10(2): 157-165
Authors:TIAN Chun-hua  CHAI Yue-ting  LIU Yi  REN Shou-ju
Abstract:Several alternatives usually exist for business process to realize the same functions. How to construct the business process with minimum cost from the potential activity set is discussed. Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented. A procedure for judging the existence of feasible solution is proposed. In the branch and bound algorithm, the forward search strategy is adopted, a modified bound algorithm is proposed, and the method of eliminating repetitive processes is discussed. The efficiency of the algorithm in reducing search complexity is illustrated by an example.
Keywords:business process  brand and bound algorithm  business process design
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号