针对钢铁生产中加热炉调度问题,考虑炉容受限的情况,以最小化板坯的Makespan和最小化总在炉加工时间为目标建立问题的多目标优化模型,将其归结为多旅行商问题.针对问题的NP-难特性,提出一种改进的修复式约束满足算法求解.松弛炉容约束得到初始调度,在检测冲突变量并构造冲突板坯的可替换加热炉集合的基础上,以开工时间偏移最小规则为冲突板坯重新指派加热炉,得到可行的调度方案.数据实验验证了模型和算法的可行性和有效性.
The parallel reheating furnaces scheduling problem with capacity constraint in steel production is studied. A multi-objective mathematical model is made to minimize makespan and total process time. As the NP-hard feature, an improved repair-based CSP algorithm is proposed. The algorithm relaxes the capacity constraint and an initial schedule is got. By testing conflict variables constantly, a new one is re-assigned from the replaceable furnaces set according to the rule of minimizing deviation of starting time, and a feasible solution without conflicts is got. The experiments show that the algorithm is feasible and effective.