一种求解排程问题的剪枝搜索算法

A search prune algorithm for scheduling

为了提升宝钢智能制造水平,针对排程的模型和算法展开了深入的研究。结合宝钢模型排程的生产实际,提出了一个可用于求解排程问题的算法。算法以材料的先后顺序为基础,以通板规程为约束,通过剪枝搜索得到满足优化目标的最优材料序列。算法充分考虑了宝钢排程的实际应用环境,可以快速、准确地运行;一次执行,可以给出多个优化目标下的最优解。目前在宝钢热镀锌产线成功应用,显著提升了计划编制效率。

To improve the intelligent manufacturing in Baosteel,a research on scheduling models and algorithms is conducted.Considering the actual situation,an algorithm for solving general scheduling problems in Baosteel is proposed.The algorithm tries to search the best sequence of material fast by pruning,under the constraint of material priorities and procedure specification.It has been applied to hot-dip galvanized product scheduling.Also it has been proved that the algorithm proposed is of great efficiency.Besides,running the algorithm one time produces several results for different goals,which is meaningful to production management.