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

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

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

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 R_(before) coupled with both sub-relations including serial before relation R_(s-before) and parallel before relation R_(p-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.