• CN:11-2187/TH
  • ISSN:0577-6686

›› 2004, Vol. 40 ›› Issue (6): 28-33.

• 论文 • 上一篇    下一篇

扫码分享

企业网络协同制造中目标分解的时序约束

董红召;陈鹰;赵燕伟   

  1. 浙江工业大学机电工程学院;浙江大学流体传动与控制国家重点实验室
  • 发布日期:2004-06-15

TIME-SEQUENCE CONSTRAINT OF PROJECT DISASSEMBLY IN THE NETWORKED COOPERATIVE MANUFACTURING SYSTEM

Dong Hongzhao;Chen Ying;Zhao Yanwei   

  1. College of Mechanical Engineering, Zhejiang University of Technology The State Key Laboratory of Fluid Power,Zhejiang University
  • Published:2004-06-15

摘要: 网络协同制造是现代企业提升综合竞争力的重要方法。协作活动开展的首要环节之一就是把协作目标分解为多项子目标,子目标的执行与其发生的时间顺序直接关联。主要提出一种新的目标分解时序约束的描述方法和算法。把分解的子目标的时序关系用Rbefore“先于”关系来描述,并根据企业协作的特点对Rbefore“先于”关系细化为两个子关系:Rs-before“串行先于”关系和Rp-before“并行先于”关系。以此为基础建立了计算子目标的执行时间区间的逆向递推算法,并为目标分解粒度的确定、减少目标执行时各子目标之间的耦合度提供了时序约束角度的准则。该方法有效地解决了基于多Agent的协同制造系统的子任务协作的时序约束问题。

关键词: Rbefore关系及其子关系, 分解粒度, 目标分解, 时序约束, 网络协同制造

Abstract: The networked cooperative manufacture among enterprises can promote their competitive capacity and the first step is to disassemble the project into several sub-projects. There are priority constraints among the sub-projects and their completion must follow a certain time sequence. Here gives a new method to describe the constraints and calculate the exact executing time area of each sub-project. The time sequence of the sub-projects can be described by our defined before relation Rbefore coupled with both sub-relations including serial before relation Rs-before and parallel before relation Rp-before. The backward deducing arithmetic to calculate the executing time areas of the sub-projects is raised. Moreover, the rules to determine the disassembling granularity of the project are proposed. Eventually, the practice proved that the method could effectively solve the time-sequence constraint issue of the sub-projects in the multi-agent based networked cooperative manufacturing system.

Key words: Before relation and its sub-relations, Disassembling granularity, Networked cooperative manufacture, Project disassembly, Time-sequence constraint

中图分类号: