基于依赖关系的产品协同设计单主体任务排序研究

中国机械工程 ›› 2010, Vol. 21 ›› Issue (05): 595-598,623.

基于依赖关系的产品协同设计单主体任务排序研究

梁学栋1;杨育1;刘爱军1;汪军2;王莹东1

1.重庆大学机械传动国家重点实验室，重庆，400030

2. 贵州省信息产业厅，贵阳，550004

出版日期:2010-03-10 发布日期:2010-03-22
基金资助:
国家自然科学基金资助项目(70601037)；教育部新世纪优秀人才支持计划资助项目(NCET-07-0908)；重庆大学“211工程”三期创新人才培养计划建设项目(S-09107)
National Natural Science Foundation of China（No. 70601037）;
Program for New Century Excellent Talents in University of Ministry of Education of China（No. NCET-07-0908）

Task Sequencing for Single Product Collaborative Designer Based on Dependency Logic

Liang Xuedong1;Yang Yu1;Liu Aijun1;Wang Jun2;Wang Yingdong1

1.State Key Lab of Mechanical Transmissions，Chongqing University，Chongqing，400030

2.Guizhou Information Industry Department，Guiyang，550004

Online:2010-03-10 Published:2010-03-22
Supported by:

National Natural Science Foundation of China（No. 70601037）;
Program for New Century Excellent Talents in University of Ministry of Education of China（No. NCET-07-0908）

摘要/Abstract

摘要：

针对产品协同设计环境下“人员－任务－资源”复杂交叉难以协调且排序标准单一的问题，基于协调理论中的依赖分析方法对产品协同设计业务规则及任务－资源依赖关系进行了逻辑分类，提出了基于改进禁忌算法的复杂协同设计环境下单主体任务协调模型。该模型能有效给出单个主体协同设计任务的最优排序并能将具有相同依赖关系的活动趋向归类。该模型所得结果与LEKIN中的WSPT启发式算法运算结果的对比验证了该排序方法的有效性和正确性。

关键词:

协同设计, 任务排序, 禁忌算法, 协调理论

Abstract:

Coordination difficulty and single sequencing standard in complicated and crossing collaborative design surroundings claim for the ‘human-task-resource’ effective sequencing. Business rules and task-resource dependence logic based on coordination theory were presented previous to improved tabu algorithm model for task sequencing of single product collaborative designer, which provided effective optimized sequencing and sort the same ‘task-resource’ dependency logic. Case study is demonstrated to illustrate the feasibility and applicability by comparing the outputs of LEKIN simulation tools. 

Key words:

collaborative design, task sequencing, tabu algorithm, coordination theory

中图分类号:

TP391

梁学栋, 杨育, 刘爱军, 汪军, 王莹东.

基于依赖关系的产品协同设计单主体任务排序研究

[J]. 中国机械工程, 2010, 21(05): 595-598,623.

LIANG Hua-Dong, YANG Yo, LIU Ai-Jun, HONG Jun, WANG Ying-Dong.

Task Sequencing for Single Product Collaborative Designer Based on Dependency Logic

[J]. China Mechanical Engineering, 2010, 21(05): 595-598,623.

参考文献

[1]王振华[1],隋鹏飞[1],郭爱斌[1],邓家禔[1].基于设计任务单元的协同设计环境研究[J].中国机械工程,2007,18(1):56-60.
[2]宋李俊[1],杨育[1],杨洁[1,2],王伟立[1].产品协同设计中的任务排序研究[J].中国机械工程,2008,19(7):798-803.
[3]杨育[1],郭波[1],尹胜[1],王伟立[1],张晓冬[1].客户协同创新的内涵与概念框架及其应用研究[J].计算机集成制造系统,2008,14(5):944-950.
[4]The Business Rules Group. Defining Business Rules -What Are They Really? [2009-12-06]. http:// www. businessrulesgroup, org/first_ paper/br01c0. htm.
[5]Halle B V. Business Rules Applied:Building Better Systems Using the Business Rules Approach[M]. New York:John Wiley & Sons,2002.
[6]Thomas W M, Kevin C. Organizing Business Knowledge: the MIT Process Handbook [ M]. Cambridge : the MIT Press, 2003.
[7]汪军.网络化制造中面向流程重用的业务流程组合研究[D].重庆大学,2006:
[8]陈晓红[1],陈志阳[1],徐选华[1].面向复杂大群体的群体决策支持平台框架研究[J].计算机集成制造系统,2008,14(9):1796-1804.
[9]胡大伟[1],陈诚[2].遗传算法（GA）和禁忌搜索算法（TS）在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007,27(9):171-176.
[10]PinedoM.调度:原理、算法和系统[M].张智海,译.北京:清华大学出版社,2007.
[11]冯大光[1,2],唐立新[1].单台批处理机总加权完成时间最小化的启发式算法[J].控制与决策,2006,21(11):1293-1297.
[12]马华伟[1],杨善林[1].可选时间窗车辆调度问题的改进禁忌搜索算法[J].系统仿真学报,2008,20(16):4454-4457.
[13]Armentano V A, Ronconi D P. Tabu Search for Total Tardiness Minimization in Flowshop Schedu- ling Problems[J]. Computers & Operations Research,1999,26(3) :219-235.
[14]Armentano V A,Scrich C R. Tabu Search Forminimizing Total Tardiness in a Job Shop[J].International Journal of Production Economics, 2000, 63 (2) : 131-140.
[15]李霄峰[1],史金飞[1],阎威武[2].混合流水车间调度的变邻域禁忌搜索算法[J].计算机工程,2008,34(21):10-11.