中小型化工企业消防安全问题研究

针对中小型化工企业的生产特点,分析了生产过程中存在的消防安全问题,并从提高安全意识、落实安全生产责任制、严格安全操作、加强消防安全管理和监督等四个方面提出了针对性的火灾事故预防措施。     

SiC纤维表面CVD SiC涂层对其单丝强度的影响

采用化学气相沉积(CVD, Chemical Vapor Deposition)工艺在KD-I型SiC纤维表面制备了SiC涂层,选择2h、4h、6h和8h四个时间点研究了沉积时间对纤维性能的影响.结果表明:具有CVD SiC涂层的SiC纤维较无涂层的纤维来说强度有所下降;在所研究的沉积时间范围内,随着沉积时间的增加,涂层的厚度有所增加,涂层由不连续的岛状转变为连续层状,纤维的单丝强度出现了先升后降的趋势.     

军用航空发动机大修能力评估方法

针对航空发动机修理工厂大修能力难以评估的问题,提出了航空发动机大修能力评估方法。分析了航空发动机大修生产过程;根据航空发动机大修生产工作特点,建立了基于生产职能分解的航空发动机大修能力评估指标体系,构建出基于熵权和灰色聚类的评估指标赋权模型;结合实例验证了方法的正确性和实用性。     

化学非平衡尾迹流场的数值计算

高超音速化学非平衡尾迹流场的分析及计算是再入空气动力学的一个重要课题。本文采用轴线极限方程,成功地消除了控制方程在轴线上的奇性;采用二阶精度的中心差隐格式,求解了抛物化的Ｎ－Ｓ方程,得到了２０ｋｍ及６０ｋｍ再入时尾迹流场的数值解。计算结果表明,在远尾迹场,对电子数密度的主要影响是Ｏ_２的吸附反应。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

舰船建造费随批量变化的成长模型分析

应用微分方程、回归分析及生长曲线３段估算法,建立批量生产条件下舰船单价变化模型,这一模型可与其他模型综合应用以取得更理想的结果．     

HF化学激光器燃烧室中燃料配比的数值分析

利用最小自由能法及质量流量守恒原则,对HF化学激光器的NF3-D2-He体系的化学平衡组分进行了计算,提出了F原子摩尔流量密度参量,分析了各输入气流的流量调节对燃烧室总温、总压、F原子产率等的影响.在燃料配比不变的情况下,总流量的增加使得F原子流量也成比例增加,而由此带来的总压升高引起的F2解离度、绝热燃烧温度、F原子...     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

石化企业火灾事故原因调查方法和技术研究

根据石油化工企业生产特点,阐述了石油化工企业火灾现场特点、火灾事故调查的重点内容、调查采取的方法和技术以及事故调查当中的注意事项,为开展好石油化工企业火灾调查工作提供参考。     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007