建立电力安全生产新机制的思考

我国现有的电力安全管理体制，是在原有的计划经济生产模式下建立的，经过几十年的电力生产实践，得到了不断的丰富和发展，探讨体制改革过程中安全管理新机制，首先就要客观地评价目前我国电力生产安全工作的现状。     

石油化工企业职业健康标准化管理问题探讨

如今职业健康问题越来越严重,受到人们的广泛关注。国家有关部门出台了一系列的职业健康法律法规和标准文件,许多企业也纷纷建立职业健康安全管理体系,有效地保护了员工的生命健康权益,促进了经济社会全面、协调、可持续的发展。但我国的职业健康工作发展形势严峻,经受着重大考验。目前,我国职业事故、职业疾病频发,危害具有群体性、普遍性、致死致残率高、治愈难度大等特点,造成了巨大的损失,使许多家庭支离破碎,单位运行不稳定,甚至引发社会矛盾,成为威胁人民安全、社会稳定的重要因素。本文阐述美国和日本的职业卫生管理现状,总结出国内职业健康管理标准化存在的问题,并为职业卫生管理工作的发展提出参考建议。     

建筑安全管理存在的问题及对策研究

目前我国建筑安全管理存在不少问题,施工中存在许多安全隐患,由于人员、技术、设备等因素的影响,施工过程也进展的并不顺利。针对传统安全管理机制存在的问题,需要对现有的安全管理方针进行实时调整,制定一套完整、科学的安全管理体系。文章结合施工管理的现状,总结了安全管理的核心原则,提出了切实可行的安全管理对策。     

高职院校实验室危险化学品的安全管理

为加强高职院校危险化学品在采购、储存、使用、危废处理等环节的安全管理,本文针对高职院校危险化学品安全管理中存在的问题和四川化工职业技术学院的管理现状,提出了健全安全管理责任制度、强化安全教育、优化软件管理系统和建设和完善硬件设施等安全管理措施。     

浅谈化工项目的安全管理

很多化工项目属于安全生产高危行业,随着国家对化工项目安全性的不断重视,化工项目安全管理的研究也越来越受到化工行业的关注。然而就目前来说,我国化工项目建设过程中的安全管理方面还存在一些比较严重的问题。本文就我国化工工程项目安全管理的现状进行了分析,总结了化工项目在建设过程中的一些问题,并有针对性地提出了化工项目安全管理的策略,为化工项目建设施工安全管理提供参考与借鉴。     

公路桥梁施工安全管理与控制途径之研究

本文首先分析了目前公路桥梁施工安全管理中存在的问题,对施工人员的安全管理意识比较缺乏、施工管理中的安全投入力度有待加强以及施工安全管理的难度比较大等问题进行了详细的阐述,然后根据这些问题总结了公路桥梁的施工安全管理控制途径,旨在为公路桥梁的施工安全管理提供有力的理论保障,提高公路桥梁的施工安全保障。     

露天矿山安全管理的对策建议与展望

本文基于对露天矿山安全管理的实践与研究,探讨了当前露天矿山安全管理存在的问题,并提出了相应的对策和建议。本文首先分析了露天矿山安全管理的重要性和现状;其次,总结了露天矿山安全管理存在的主要问题,并且还提出了完善安全管理制度、加强安全培训和教育、优化安全监测与预警系统等对策和建议;最后,本文总结了露天矿山安全管理的关键点和发展方向,为进一步提高矿山安全管理水平提供参考。     

“石化和化学工业‘十二五’发展规划说明会”特别报道(四) 提升化学工业安全环保与园区建设管理水平

对我国化工行业的安全形势、环保形势以及园区发展现状进行了数据统计与总结分析,指出目前在化学品安全管理、环境保护以及化工园区建设等方面存在的问题与不足。结合最新国家政策,提出了提升我国化工行业安全管理水平、加强环境保护及建设绿色化工园区等三个方面的工作重点。     

职业危害因素检测过程中安全健康环境管理探讨

职业卫生技术服务机构中安全健康环境问题较为突出,本文就职业危害因素检测过程中常见的安全健康环境管理问题进行了分析探讨。     

高校科研院所化学实验室安全管理探讨

综述了高校科研院所化学实验室的安全现状、不安全因素,总结了化学实验室安全管理隐患及普遍存在的共性问题。针对上述问题,分别从实验室安全管理责任、运行机制、危险源管理、设施配备、应急预案、事故处置六个方面进行了阐述,探索应对方法、探讨高校科研院所化学实验室安全管理工作。     

A MILP model for N-dimensional allocation

This paper presents a Mixed Integer Linear Programming (MILP) model for the solution of N-dimensional allocation problems. The applicability of the model is presented and demonstrated through some illustrative examples with different numbers of dimensions. Several problems, previously presented in the literature, are solved using the proposed model, such as, one-dimensional scheduling problems, two-dimensional cutting problems, as well as plant layout problems and three-dimensional packing problems. Additionally, some problems in four dimensions are presented and solved using the considered model. The presented model is applicable to a wide variety of allocation problems as it offers a general framework for modelling allocation problems with any given number of continuous or discrete dimensions. The presented problems are formulated as MILP problems where the first four dimensions usually are continuous spatial and time dimensions. Additional dimensions are often of a discrete nature.     

加氢裂化装置开工过程出现的问题分析及处理

阐述了加氢裂化装置在开工过程中出现的问题,对问题产生的原因进行了分析,继而总结了处理的方法,提出了避免发生类似问题的看法。     

A Review of Ozone Generating Facilities in Some U.S. Water and Wastewater Treatment Plants

In previous years, the start-up and operation of ozone systems at U.S. municipal water and wastewater treatment facilities has resulted in numerous problems. Some of these problems were of such a magnitude that the operating agency decided to abandon the ozone system. In other cases, the system is operating and the problems are resolved. An investigation of 11 U.S. facilities was conducted to determine what problems were experienced and how the problems were resolved.     

轮胎接触问题的分析与研究

简要地综述了轮胎接触问题分析的发展过程及所使用的一些方法，着重介绍了三维有限元法在轮胎接触问题中的应用，同时也概括了弹性力学理论及实验测试在轮胎接触问题中的应用。本文对轮胎接触问题的分析主要是围绕静态接触和滚动接触两方面展开论述的，列出了轮胎接触问题中轮胎变形、接触区形状大小、接触压力分布、应力分布、载荷变形关系、内轮廓形状等结果     

涂装风机设备调试问题解决方法探讨

通过汽车涂装风机设备在调试过程中所遇到的问题，结合现场情况，从整个设备的设计图、安装、调试以及工作环境等进行问题分析、排查，分析问题原因并提出相应解决方法和步骤，找出可能存在的问题，直到最终解决问题、     

Optimizing Injection Molding Toward Multiple Quality and Cost Issues

Injection-molding part designers are frequently faced with multiple quality and cost issues. These issues are usually in conflict with each other; thus, a trade-off needs to be made to reach a final compromised solution. Because evaluation of part quality and cost via injection-molding simulation is very time-consuming, implementation of a conventional multicriteria optimization procedure for injection-molding problems is economically unfavorable. However, many injection-molding problems dealing with multiple quality and cost issues can be modeled as constrained problems, with the total cost as the objective function and quality quantities as the constraints. By introducing a concept of penalized total cost, such constrained problems are further simplified into bounded single-criterion problems. The bounded single-criterion problems are then optimized using a direct search-based optimization procedure. Strategies of modeling, transformation, and optimization for these problems are discussed in this article. A case study is provided.     

PARALLEL SOLUTION OF DISJUNCTIVE MINLP PROBLEMS

In this paper, a system for parallel solution of large scale disjunctive optimization problems is presented. Disjunctive optimization problems occur in process engineering; both in production scheduling and in process synthesis. In general these problems are computationally very hard to solve.

This system combines the demands of process engineering optimization problems with the potential CPU-power of the computers connected to the Internet. The system is capable of using an arbitrary number of computers connected to the Internet for distributed solution of rigorous industrial optimization problems.     

Solving mixed integer nonlinear programming problems with line-up competition algorithm

Line-up competition algorithm (LCA), a global optimization algorithm proposed recently, is applied to the solution of mixed integer nonlinear programming (MINLP) problems. Through using alternative schemes to handle integer variables, the algorithm reported previously for solving NLP problems can be extended expediently to the solution of MINLP problems. The performance of the LCA is tested with several non-convex MINLP problems published in the literature, including the optimal design of multi-product batch chemical processes and the location-allocation problem. Testing shows that the LCA algorithm is efficient and robust in the solution of MINLP problems.     

A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—II. Application of theory and test problems

In Part I (Floudas and Visweswaran, Computers chem. Engng 14, 1397, 1990), a deterministic global optimization approach was proposed for solving certain classes of nonconvex optimization problems. An algorithm, GOP, was presented for the rigorous solution of the problem through a series of primal and relaxed dual problems until the upper and lower bounds from these problems converged to an -global optimum. In this paper, theoretical results are presented for several classes of mathematical programming problems that include: (i) the general quadratic programming problem; (ii) quadratic programming problems with quadratic constraints; (iii) pooling and blending problems; and (iv) unconstrained and constrained optimization problems with polynomial terms in the objective function and/or constraints. For each class, a few examples are presented illustrating the approach.     

A generalization of the Branch-and-Sandwich algorithm: From continuous to mixed-integer nonlinear bilevel problems

We propose a deterministic global optimization algorithm for mixed-integer nonlinear bilevel problems (MINBP) by generalizing the Branch-and-Sandwich algorithm (Kleniati and Adjiman, 2014a). Advances include the removal of regularity assumptions and the extension of the algorithm to mixed-integer problems. The proposed algorithm can solve very general MINBP problems to global optimality, including problems with inner equality constraints that depend on the inner and outer variables. Inner lower and inner upper bounding problems are constructed to bound the inner optimal value function and provide constant-bound cuts for the outer bounding problems. To remove the need for regularity, we introduce a robust counterpart approach for the inner upper bounding problem. Branching is allowed on all variables without distinction by keeping track of refined partitions of the inner space for every refined subdomain of the outer space. Finite ɛ-convergence to the global solution is proved. The algorithm is applied successfully to 10 mixed-integer literature problems.