Optimal material control in an assembly system with component commonality

Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001     

防空导弹武器系统目标分配的多种算法

叙述了防空导弹武器系统目标分配的一般数学模型。在此基础上,建立了防空导弹的5种目标分配数学优化算法,并讨论了数学模型的求解问题。最后,对这5种数学优化算法进行了比较。     

测量TOA和DOA的单站无源定位跟踪可观测条件

单站无源定位跟踪技术中,可观测性分析是一个关键问题,但是由于TOA测量方程的非线性程度太高,直接通过计算Jacobin矩阵得到的可观测矩阵形式非常复杂,很难得出明确的分析结果。采用新的思路推导了一种TOA测量方程的线性化方程,分析了测量TOA和DOA单站无源定位的可观测条件。最后给出了计算机仿真结果。     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

仿真计算机和仿真软件发展

介绍仿真机和仿真软件的发展,分析了银河仿真机系统性能,探讨了仿真机的未来发展特征。     

软件无线电的关键技术及其发展趋势

软件无线电技术近年来得到了较快发展,其主要是利用软件来实现无线通信系统中的各种功能。介绍了软件无线电的关键技术、评价标准和发展过程,并展望了软件无线电的发展前景。     

应用SoC实现装备维修改造的研究

片上系统(SoC)技术是近年来随着微电子技术发展出现的新技术,现已被广泛应用.利用SoC可以将原来由许多芯片完成的复杂功能,集中到一块芯片中完成,以获得更高的系统性能.以某火控系统中的模拟量输入通道为例,阐述了通过SoC技术,用基于FPGA/CPLD的方法对火控系统硬件电路进行维修改造,从而探讨了解决装备维修问题的一种方法.并讨论了改造过程中单稳态触发器96L02的替代问题,以及FPGA/CPLD与外围电路的驱动能力问题.     

改善逆变器输出电压波形的研究

在115 V/400Hz逆变电源中,A/D转换器引起的量化误差对系统的影响是造成系统不稳定的主要因素之一.通过对逆变器反馈通道误差的分析,采用全波整流电路对115 V/400 Hz逆变电源中A/D采样电路进行了改进,减小反馈通道误差,使逆变器的稳态电压输出波形质量得到显著改善.     

GPS/INS复合制导技术

近年来随着制导技术的发展,国外许多新型的武器装备都采用了GPS/INS复合制导技术。介绍了国外GPS/INS复合制导技术的发展和应用,重点分析了惯性导航系统和全球定位系统的优缺点,综述了GPS/INS复合制导的工作原理和关键技术。文中列举了美国GPS/INS系统的小型化,以及GPS/INS复合制导系统在SM-3导弹、洲际导弹等多种导弹制导过程中发挥的作用。由此可见,掌握国外复合制导体系的发展动态对我国GPS/INS复合制导技术的发展将起到重要的借鉴和启示作用。     

Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005