Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

有约束的Hartley域自适应算法的应用研究

通过对有约束的Hartley域自适应算法、频域自适应算法及时域自适应算法用于自适应降噪系统的计算机仿真研究 ,认为在自适应通信降噪中采用基于Hartley变换的自适应算法较频域自适应算法及时域自适应算法性能更优、降噪效果更好 ,并在高速信号处理器TMS32 0C30上开发实现了该算法 .实验结果表明 ,将Hartley域自适应算法应用于通信降噪系统 ,方法实际可行     

考虑摩擦时Diesel循环功率效率特性新析

对有摩擦时Diesel循环进行了有限时间热力学分析 .导出功率和压缩比、效率和压缩比的新关系式 ,进而得到功率效率关系 ,并进行了计算和讨论 ,给出一些有益的结论     

An application of yield management for Internet Service Providers

In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001     

Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least K_i of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest K_i and allocates functioning components to subsystems in increasing order of the K_i's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the K_i's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 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     

An optimal structured policy for maintenance of partially observable aircraft engine components

This paper considers the maintenance of aircraft engine components that are subject to stress. We model the deterioration process by means of the cumulative jump process representation of crack growth. However, because in many cases cracks are not easily observable, maintenance decisions must be made on the basis of other information. We incorporate stress information collected via sensors into the scheduling decision process by means of a partially observable Markov decision process model. Using this model, we demonstrate the optimality of structured maintenance policies, which support practical maintenance schedules. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 335–352, 1998     

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.     

基于粒子群算法的宽带真延时平面阵列方向图综合

针对大阵元间距平面阵列方向图综合问题,提出基于粒子群算法的宽带真延时平面阵列方向图综合方法。该方法根据真延时条件下阵列方向图主瓣和栅瓣指向的特点,采用宽带真延时抑制阵列方向图的栅瓣;利用粒子群优化算法优化阵列结构,得到具有较高主副瓣比的平面阵列方向图。通过对8×8的矩形平面阵进行仿真,验证了所提方法的有效性,在此基础上,还仿真研究了该方法对栅瓣的抑制性能与信号带宽之间的关系。