钢铁生产中吊机与多阶段生产协调调度的问题  

Coordinated Scheduling Problem With Crane and Multi-Production in Steel Industry

作　　者：谢谢[1] 郑勇跃 刘柳 李晓丽 XIE Xie;ZHENG Yongyue;LIU Liu;LI Xiaoli(Key Laboratory of Manufacturing Industrial and Integrated Automation,Shenyang University,Shenyang 110044,China;School of Information Engineering,Shenyang University,Shenyang 110044,China;Center of Career Development,Liaoning Inspection,Examination&Certification Centre,Shenyang 110032,China;Shuangliao Vocational High School,Shuangliao 136400,China)

机构地区：[1]沈阳大学装备制造综合自动化重点实验室,辽宁沈阳110044 [2]沈阳大学信息工程学院,辽宁沈阳110044 [3]辽宁省检验检测认证中心事业发展中心,辽宁沈阳110032 [4]吉林省双辽市职业高级中学,吉林双辽136400

出　　处：《沈阳大学学报（自然科学版）》2022年第2期106-111,共6页Journal of Shenyang University：Natural Science

基　　金：国家自然科学基金资助项目(71672117);辽宁省自然科学基金资助项目(2020-BS-263)。

摘　　要：以钢铁企业生产过程的总流程为背景,将吊机调度与多阶段生产调度问题集成考虑,提炼出一类吊机与多阶段生产设备衔接调度的问题,目标函数为最小化最大完工时间。针对该问题,提出求解问题的启发式算法,为验证算法的性能,进一步提出问题的下界并给出了渐近性能分析。计算实验结果表明启发式算法的渐近最优性以及下界的有效性。Taking the general process of the production process of iron and steel enterprises as the background,the problem of crane scheduling and multi-stage production scheduling was integrated into consideration,and the problem of connection scheduling between a type of crane and multi-stage production equipment was extracted.The objective function was minimizing the completion time of the last processed job(makespan).Aiming at this problem,a heuristic algorithm for solving the problem was proposed.In order to verify the performance of the algorithm,the lower bound of the problem was further proposed and an asymptotic performance analysis was given.Computational experimental results demonstrated the asymptotic optimality of the heuristic algorithm and the effectiveness of the lower bound.

关 键 词：钢铁企业 吊机调度 NP-难 启发式算法 渐近最优 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]