基于约束满足的产品动态替补模型及算法  

Dynamic substitute model and algorithm for product based on constraint satisfaction

作　　者：涂雪平[1,2,3] 李铁克[1,2] 

机构地区：[1]北京科技大学东凌经济管理学院,北京100083 [2]北京科技大学钢铁生产制造执行系统技术教育部工程研究中心,北京100083 [3]东方电气集团东方锅炉股份有限公司,四川自贡643001

出　　处：《计算机集成制造系统》2016年第5期1287-1295,共9页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(70771008;70371057);中央高校基本科研业务费专项资金资助项目(FRF-AS-09-007B)~~

摘　　要：为解决订单在生产过程中因某动态因素导致其出现产品质量问题而无法按期交货的问题,建立了以最小化产品替补总成本和订单之间替补次数为目标的多等级产品动态替补模型;根据问题的特点,证明了该问题为NP完全问题;基于约束满足技术,提出求解该问题的动态产品替补算法。该算法旨在根据订单交货期紧急程度以及其中的产品等级进行产品替补以制定替补机制。通过实验验证了模型和算法的可行性和有效性,并且完全能在满足生产实际的条件下获得最优解。To solve the delay in delivery of orders caused by unqualified product in productive process, a dynamic substitute model for multi-class product was presented by considering the minimized substitute-cost and substitute- times among orders. According to the characteristics of problem, it was proved be NP complete problem. A dynam- ic product substitute algorithm based on Constraint Satisfaction was proposed. Based on constraint satisfaction tech- nology, the dynamic substitute algorithm to solve this problem was proposed, which was formulated substitute mechanism according to product substitution between urgency levels and product levels of orders. The effectiveness and feasibility of proposed algorithm was tested with simulation examination, and the best solution could be obtained by satisfying the actual product condition.

关 键 词：约束满足 多等级产品 动态替补机制 算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]