Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.     

固体超强酸S_2O_8~(2-)/SnO_2-SiO_2催化合成环己酮1,2-丙二醇缩酮

采用沉淀-浸渍法制备了固体超强酸S2O28-/SnO2-SiO2,以它为催化剂催化环己酮和1,2-丙二醇合成了环己酮1,2-丙二醇缩酮;考察了带水剂种类及用量、酮醇摩尔比、催化剂用量、反应时间对产品收率的影响,并用正交实验对反应条件进行了优化。实验结果表明,适宜的反应条件为:n(环己酮)∶n(1,2-丙二醇)=1∶1.6、催化剂用量为反应物料总质量的2.0%、带水剂环己烷用量5.0mL、反应时间50min。在此条件下,环己酮1,2-丙二醇缩酮收率达到91.47%;催化剂的稳定性良好,在重复使用5次后环己酮1,2-丙二醇缩酮收率为82.20%,活性下降的主要原因为催化剂表面积碳和吸附了有机物;经傅里叶变换红外光谱和气相色谱质谱分析表明,产物为环己酮1,2-丙二醇缩酮,纯度为100%。     

文东油田连续气举优化配气数学模型建立及应用

针对连续气举在开发过程中出现的注入气利用效率低、综合效益差的问题，建立了供气能力有限时的优化配气数学模型，给出了解析法求解过程。文东油田现场试验表明，应用该技术可以实现连续气举井的合理配气，并提高油井产量，适合在油田推广应用。     

空调风机的特点及合理选型

介绍了空调风机的特点，并通过实例说明了风机合理的选型过程。     

酸度计的检定校准方法

本文简单介绍了几种常用进口（合资）品牌的酸度计的检定校准方法，以供检定人员参考，共同提高。     

西南油气田建设用地面临的困难及其对策

从四川盆地油气勘探开发建设用地特点入手,分析了西南油气田用地现状和新形势下油气勘探开发建设用地在保证工期、控制成本、提高效率、政策支持、关系协调等方面所面临的挑战,提出了下一步为保证生产建设用地按时、有效、科学、合理、合法的取得而应采取的有效措施。     

IPTV运营支撑系统构建分析

运营支撑系统是IPTV平台的一个重要组成部分,对它的建设必须坚持高起点、严要求.运营支撑系统应该具备：先进性、实时性、安全性、可用性、可靠性、可维护性、可操作性、开放性和可扩充性.IPTV运行支撑系统功能结构如图1所示.     

A fast evolutionary pursuit algorithm based on linearly combining vectors

In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.