摘要
针对客户订单的重量需求为固定值、客户订单分配过程中有最小重量限制的板坯设计问题,建立了以最小化板坯数量为目标的约束满足模型.通过三划分问题的多项式归结,证明了该问题是强NP难的;针对问题的特殊性质,给出了变量选择策略和值选择策略;提出了基于约束满足技术的求解算法,并证明了算法的收敛性;通过数据实验对算法的有效性进行了验证.
A constraint satisfaction model whose objective is to minimize the slab number was built for slab production in consideration of the slab designing problem with a fixed demand of order weight and a minimum limitation of order weight assigned in one slab. The problem was proved to be NP-hard by reducing a known NP-hard three-partition problem to the discussed problem in polynomial time. Concerning with special characteristics of the problem, variable selection strategies and value selection strategies were presented. A constraint-satisfaction-based algorithm was proposed and it was proved to be convergent. The effectiveness of the proposed algorithm was verified with simulation experiments.
出处
《北京科技大学学报》
EI
CAS
CSCD
北大核心
2011年第5期641-646,共6页
Journal of University of Science and Technology Beijing
基金
国家自然科学基金资助项目(No.70771008)
中央高校基本科研业务费专项(No.FRF-AS-09-007B)
宁夏医科大学特殊人才科研启动基金项目
关键词
热轧
板坯
生产计划
约束满足
变量选择
值选择
hot rolling
slabs
production planning
constraint satisfaction
variable selection
value selection
