摘要
针对并行加热炉群调度问题,提出了以板坯的最大完工时间和炉内总停留时间最小化为目标的求解算法.算法由3个阶段组成:第1阶段以关键路规则为基础确定板坯排序,在一定条件下具有最优性;第2阶段对任意给定的板坯排序,给出该排序下关于炉内总停留时间的最优可行排序;第3阶段对任意给定的可行板坯排序,给出该可行板坯排序下满足板坯释放时间的最优调度方案.
The parallel reheating furnaces scheduling problem for minimizing makespan and total process time is studied.A solving algorithm is proposed,which is consists of three stages.The aim of the first stage is to obtain a rank of slabs,which can reach the optimal solution under certain conditions based on the critical path rule.Under any given rank of slabs,a feasible sequence with the minimal total process time is generated in the second stage.In the last stage,the release time is considered,and an optimal schedule is achieved with the determined feasible sequence.
出处
《系统工程学报》
CSCD
北大核心
2011年第1期105-112,共8页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(70771008
70371057)
关键词
钢铁生产
加热炉调度
并行机
关键路规则
steelmaking production
reheating furnaces scheduling
parallel machines
critical path rule
