顺序输送管道混油浓度PHOENICS数值模拟

针对现有一些顺序输送混油计算公式中存在的问题,在κ-ε紊流模型和使用壁面函数法处理近壁区问题的理论基础上,提出了顺序输送混油新的模型,并利用PHOENICS软件成功地对该模型进行了数值求解.且首次以图像的形式直观地显示出管内的混油浓度分布,并通过浓度曲线的对比,对油品输送次序对混油的影响进行了分析.研究结果表明:计算机模拟能够为顺序输送混油机理的研究提供一个较为准确而便利的手段.同时也对影响混油的其他一些因素(高差、阀件、温度等)的研究提供了参考与帮助.     

压水堆运行中ΔT超温度/超功率保护分析

从核电站压水堆动力装置在运行中ΔT超温度 /超功率保护功能出发 ,介绍了压水堆ΔT超温度 /超功率保护系统 ,分析了确定极限限制线以及保护区的方法 ,并对此作出了评价 .     

The dynamic transshipment problem

We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

Lateral stock transshipments in a two‐location inventory system with fixed and joint replenishment costs

We address the problem of inventory management in a two‐location inventory system, in which the transshipments are carried out as means of emergency or alternative supply after demand has been realized. This model differs from previous ones as regards its replenishment costs structure, in which nonnegligible fixed replenishment costs and a joint replenishment cost are considered. The single period planning horizon is analyzed, with the form and several properties of the optimal replenishment and transshipment policies developed, discussed and illustrated. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 525–547, 1999     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

基于虚拟仪器的便携式轴角测试系统

针对轴角测试在武器控制领域的重要性,以及满足现代工业对便携式数据采集与测量的要求,提出了一种采用虚拟仪器技术的便携式轴角信号测试方法.由便携式计算机和轴角信号采集器组成轴角测试硬件平台,通过EPP实现两者间的高速数据通讯,由软件完成对数据的采集、显示、存储以及分析处理.可实现四通道数据同时测量,单通道采集率可达400kbyte/s.该系统具有体积小,重量轻,功耗低、现场移动使用方便等特点,特别适用于科研、生产及维修领域的现场测试.     

面向大规模集群的并行I/O用户层配置优化策略

影响应用I/O性能的关键因素主要有三个层次:包括应用的I/O接口实现、体系结构和文件系统组件的性能以及应用的I/O参数配置。从应用I/O配置优化的视角,分析了大规模集群并行I/O的配置调优空间,在此基础上,给出了一套大规模集群并行I/O性能特征测试分析方法。基于该方法,在某国产超级计算集群上开展了一系列I/O测试分析来刻画系统的I/O性能特征,进而指导并行应用程序的I/O配置优化。基于优化后的配置参数,在两类典型的并行I/O场景中,针对某类生产应用程序,8192进程下的重启动数据写操作时间下降了15%,4096核的程序作业加载时间从10 min缩短到了5 s。     

Inventory transshipment game with limited supply: Trap or treat

Inventory transshipment is generally shown to be beneficial to retailers by matching their excess demand with surplus inventory. We investigate an inventory transshipment game with two newsvendor-type retailers under limited total supply and check whether the retailers are better off than the case without transshipment. We derive the ordering strategies for the retailers and show that unlike the unlimited supply case, a pure Nash equilibrium only exists under certain conditions. Furthermore, contrary to the conventional wisdom, we show that inventory transshipment may not always benefit both retailers. Although one of the retailers is guaranteed to be better off, the other could be worse off. The decision criteria are then provided for the retailers to determine if they will benefit from the exercise of inventory transshipment. Numerical study indicates that the carefully chosen transshipment prices play an important role in keeping inventory transshipment beneficial to both retailers. Subsequently, a coordinating mechanism is designed for the retailers to negotiate transshipment prices that maximize the total profit of the two retailers while keeping each of them in a beneficial position.