检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李显昱 黄德先[1] 尚超[1] 亓鲁刚 LI Xianyu;HUANG Dexian;SHANG Chao;QI Lugang(Department of Automation,Tsinghua University,Beijing 100084,China;Tangshan Huitang IoT Technology Co.,Ltd.,Tangshan 063000,China)
机构地区:[1]清华大学自动化系,北京100084 [2]唐山惠唐物联科技有限公司,河北唐山063000
出 处:《控制工程》2025年第1期148-157,共10页Control Engineering of China
基 金:国家自然科学基金资助项目(62003187)。
摘 要:面向某钢铁企业在炼钢-连铸阶段的复杂生产调度问题,提出了一种基于连续时间表示的调度建模方法。依据炼钢-连铸过程的每个浇次中各炉次的保序性,针对每一台生产设备,将每个炉次的作业开始与结束时间作为决策变量,并根据避免作业冲突的原则构建约束;同时,定义离散决策变量,保证炉次在同一类生产设备中进行作业的唯一性。最终,调度模型被构建为一个混合整数规划问题,从而便于使用商业求解器高效求解。在同一生产计划中对基于不同时间表示方法的调度模型进行仿真测试,仿真结果表明,所提方法能够在要求的运行时间内得到满足工艺要求的最优决策,在工程应用中具有可行性。To solve the complex production scheduling problem of a specific steel company in the steelmaking and continuous casting stage,a scheduling modeling method based on continuous-time representation is proposed.According to the order invariance of each charge in each casting in the steelmaking and continuous casting process,the start and end time of each charge operation are used as decision variables for each machine,and constraints are constructed according to the principle of avoiding operation conflicts.At the same time,discrete decision variables are defined to ensure the uniqueness of charge operations within the same type of machine.Finally,the scheduling model is constructed as a mixed integer linear programming problem,which can be solved efficiently with commercial solvers.The scheduling models based on different time representation methods are tested in the same production plan.The simulation results show that the proposed method can obtain the optimal decision that meets the process requirements within the required running time,and is feasible for engineering applications.
关 键 词:炼钢-连铸过程 连续时间表示 调度优化 混合整数规划
分 类 号:TP278[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222