Markovian approximation for manufacturing systems of unreliable machines in tandem

This paper studies production planning of manufacturing systems of unreliable machines in tandem. The manufacturing system considered here produces one type of product. The demand is assumed to be a Poisson process and the processing time for one unit of product in each machine is exponentially distributed. A broken machine is subject to a sequence of repairing processes. The up time and the repairing time in each phase are assumed to be exponentially distributed. We study the manufacturing system by considering each machine as an individual system with stochastic supply and demand. The Markov Modulated Poisson Process (MMPP) is applied to model the process of supply. Numerical examples are given to demonstrate the accuracy of the proposed method. We employ (s, S) policy as production control. Fast algorithms are presented to solve the average running costs of the machine system for a given (s, S) policy and hence the approximated optimal (s, S) policy. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 65–78, 2001     

专用字符集译码逻辑的程序优化设计

提出了一种组合逻辑译码电路优化设计的基本原则 ,给出了基于该优化设计原则的程序设计所涉及的关键数据结构和算法 ,并利用现有中小规模译码驱动电路 744 8系列芯片和门电路等实现了工程实践中需要的特殊字符集译码优化设计的参考电路 .     

The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

Orbix的分布对象计算性能分析

通过一个计数器的分布对象设计及Orbix实现,阐明了先进的分布对象技术标准CORBA的核心概念以及符合CORBA2．0标准的中间件产品Orbix的分布对象设计和实现过程,通过计算比较并分析了Orbix在单机和网络分布环境下实现效率的差异,并提出了用单机模拟网络环境下分布对象实现效率的方法．     

A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system

This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000     

对潜搜索的灰色整数规划模型

在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴.     

弹炮混编防空群兵力分配模型

针对对付现代日益发展的空袭手段的一种有效方法--弹炮混编防空布势中存在的防空武器种类繁多,兵力分配复杂,难以充分发挥各自效能的问题,建立了非线性规划模型,利用动态规划对该模型进行分析,运用拉格朗日降维法进行降维,将三维降为二维.经防空作战的实例验证该算法不但能将两维降到单维,而且还可以将多维降到单维,能节省计算机的内存使用率,提高仿真计算的速度,符合信息化条件下指挥决策实时化的要求且分配效果较好.     

Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

金属泡沫断裂韧性的试验研究

金属泡沫在其实际应用中,断裂性能和断裂韧性对于承载的多孔金属泡沫有着重要的意义。基于美国试验材料学会相关标准,采用三点弯曲试样测定了铝泡沫的I型断裂韧性。研究表明,金属泡沫的断裂为脆性断裂,在裂纹尖端附近,孔壁最薄弱的区域最容易发生变形;随着进一步加载,一些孔壁发生断裂,微裂纹在断裂尖端附近出现。随着载荷的增加,主裂纹在缺口根部形成或由微裂纹合并而成,并开始在多孔结构内传播。裂纹沿着结构最薄弱处传播,并产生次生裂纹和裂纹桥。裂纹总的扩展方式还是I型断裂。根据试验P-V曲线特点,取最大载荷点对应的力与位移求解出铝泡沫的裂纹尖端临界张开位移的平均值为0.051 mm。