基于序列关系的维修资源匹配算法研究  

Maintenance Resource Matching Algorithm Based on Sequential Relationships

作　　者：崔萌[1] 耿伯英[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《舰船电子工程》2016年第12期121-126,共6页Ship Electronic Engineering

基　　金：湖北省自然科学基金项目(编号:2014CKB1013)资助

摘　　要：由多个维修工序组成的维修任务,是依照三种基本逻辑关系构建形成的有向序列。论文给出维修任务的形式化定义,并将维修资源匹配问题简化为维修工序对维修保障能力需求的满足。在建立单维修工序维修资源匹配模型的基础上,构建形成多维修工序维修任务资源匹配模型。仿真算例表明在资源分配中论文方法在满足时间约束以及克服资源分配局部短视等方面具有优势。Based on the maintenance task structure, this paper clomifies that the maintenance task is a directed sequence which is made of three types of process relationship. It sets forth the definition of maintenance task. And the maintenance task resource matching is realized as the maintenance capability fulfillment of processes. This paper sets forth the resources matching model for single maintenance process, sequential relationship processes, parallel relationship processes, conditional relationship processes. Finally, the resource matching model is composed for the maintenance task. Simulation result shows that the algorithm has an edge than MDLS in satisfying time constraint and overcoming resource matching shortsighted prob-lem.

关 键 词：维修资源 逻辑关系 有向序列 匹配约束 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]