首页 | 本学科首页   官方微博 | 高级检索  
     

约束满足技术在板坯排序中的应用
引用本文:郭冬芬,李铁克.约束满足技术在板坯排序中的应用[J].计算机工程与应用,2007,43(9):1-3,10.
作者姓名:郭冬芬  李铁克
作者单位:北京科技大学,管理学院,北京,100083;石家庄邮电职业技术学院,石家庄,050021;北京科技大学,管理学院,北京,100083
摘    要:热轧调度中的板坯排序问题是一类特殊的排序问题,具有约束条件复杂、NP难特点。为了简化问题,将板坯排序问题转化为一个约束满足问题处理。给出板坯排序问题的约束满足模型,设计了基于约束满足和启发式混合求解算法。用3组实际生产数据对算法性能进行验证,说明了算法的有效性。

关 键 词:热轧调度  约束满足问题  约束传播  节点互换算法
文章编号:1002-8331(2007)09-0001-03
修稿时间:2006-11

Application of constraint satisfaction technology in slab sequencing problem of hot rolling scheduling
GUO Dong-fen,LI Tie-ke.Application of constraint satisfaction technology in slab sequencing problem of hot rolling scheduling[J].Computer Engineering and Applications,2007,43(9):1-3,10.
Authors:GUO Dong-fen  LI Tie-ke
Affiliation:1.School of Management,University of Science and Technology Beijing,Beijing 100083, China; 2.Shijiazhuang Post and Telecommunication Technology College,Shijiazhuang 050021 ,China
Abstract:Slab sequencing problem is a kind of special sequencing problem with complex constraints and NP-hard character.In order to simplify problem,it is treated as a constraint satisfaction problem.A constraint satisfaction model is given.A hybrid solving algorithm is designed based on constraint satisfaction and heuristics node exchange algorithm. The validity of the proposed solving algorithm is demonstrated by 3 groups of production data simulation experimentation.
Keywords:hot rolling scheduling  constraint satisfaction problem  constraint propagation  node exchange algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号