期刊文献+

基于优化调度模型的焦炉推焦计划编制方法 被引量:5

Coke oven working planning based on optimization scheduling models
下载PDF
导出
摘要 针对焦炉正常和异常2种工况,提出基于优化调度模型的焦炉作业计划编制方案。在正常工况下,建立使设备总的机械行程最短、出焦延迟时间最短和检修时间足够长的优化调度模型;在异常工况下,通过将乱笺炉号、事故状态、病号炉3种情况归结为乱笺炉号的情况,建立系统实现目标不变,以恢复过程中所有小循环总费用最小为目标的异常工况下的优化调度模型。针对2种优化调度模型,分别提出正常工况下的焦炉作业计划编排方法和基于Dijkstra算法的异常工况焦炉作业计划编排方法,该方法将实际的乱笺问题转化为最短路径问题。仿真实验结果表明,采用该方法实现了推焦计划的自动编制,提高了生产效率和企业的经济效益,证明该方法是有效的。 A coke oven working planning based on optimization scheduling models was presented for normal and abnormal conditions of coke oven. Under the normal conditions, an optimization model was obtained to achieve the shortest mechanism path in the facilities, the shortest lag time of pushing management and enough repairing time. Under the abnormal conditions, oven number out of sequence, accident state and broken oven were uniformly described as oven number out of sequence. Based on that, an optimization model for the abnormal conditions was established to achieve targets and the least cost of little cycle in recovering process. To deal with these two optimization models, the corresponding coke oven working planning was proposed, i.e., one was under normal conditions, and the other was based on Dijkstra algorithm under abnormal conditions. This method translates the practical chaotic groups into the shortest path problem. The simulation results show that the proposed methods can be used to realize coke plans automatically and efficiency of production and the economic efficiency of enterprises are enhanced, so the proposed method is effective.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2007年第4期745-750,共6页 Journal of Central South University:Science and Technology
基金 国家"863"计划资助项目(2006AA04Z172) 国家杰出青年科学基金资助项目(60425310)
关键词 焦炉 优化调度 最短路径算法 DIJKSTRA算法 coke oven optimization scheduling the shortest path algorithm Dijkstra algorithm
  • 相关文献

参考文献14

二级参考文献77

  • 1李建祥,唐立新,吴会江,庞哈利.基于规则的热轧钢管调度[J].钢铁,2004,39(9):39-42. 被引量:7
  • 2赖旭芝,周国雄,曹卫华,吴敏.焦炉集气管的模糊专家控制方法及其应用[J].控制工程,2006,13(2):108-110. 被引量:21
  • 3唐立新.CIMS下生产批量计划理论及其应用[M].北京:科学出版社,1998..
  • 4NJ尼尔逊 石纯一译.人工智能原理[M].北京:科学出版社,1983..
  • 5[1]Tang Lixin,Liu Jiyin, Aiying Rong,et al. Modeling and a Genetic Algorithm Solution for the Slab Stack Shuffling Problem When Implementing Steel Rolling Schedules[J]. International Journal of Production Research, 2002, 40(5): 1583~1595
  • 6[2]Feng Xin, Tang Lixin,Leung Hofung. Applying GENET to the JSSCSOP[R]. Lecture Notes in Computer Science 3173, 2004:454~461
  • 7[3]Tang Lixin, Xuan Hua,Liu Jiyin. A New Lagrangian Relaxation Algorithm for Hybrid Flowshop Scheduling With Total Weighted Completion Time[J]. Computer & Operations Research,(Accepted),2005.
  • 8[4]Tang Lixin,Huang Lin.An Exact Algorithm & Near-optimal Algorithms to Rolling Batch Scheduling for Seamless Steel Tube Production[J]. International Journal of Production Economic(Accepted), 2004.
  • 9[5]Tang Lixin,Zhang Yanyan. A Neural Network Model and Algorithm for the Hybrid Flow Shop Scheduling Problem[J]. Lecture Notes in Computer Science (Accepted), 2005.
  • 10[6]Feng Xin, Leung Hofung,Tang Lixin. A Genet Neural Network Model and Algorithm for the Job Shop Scheduling Problem[J]. Lecture Notes in Computer Science (Accepted), 2005.

共引文献340

同被引文献62

引证文献5

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部