Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于多目标优化的液体火箭发动机减损与延寿控制

着重分析了减损与延寿控制律的综合过程,提出其基于多目标优化方法的理论基础。在建立某型液体火箭发动机系统动力学模型、关键部件之涡轮叶片的结构分析模型及其材料损伤模型的基础上,分析了应用非线性规划法求解减损与延寿控制律的过程。对发动机起动过程实施减损与延寿控制,结果表明在系统性能略微损失的情况下,可以较大幅度地减小涡轮叶片的损伤,从而达到延长发动机工作寿命的目的。     

基于反馈线性化的EMS型磁浮列车非线性悬浮控制器设计

悬浮系统控制技术是EMS型磁浮列车的关键技术之一。针对悬浮系统的非线性特征,设计了一种非线性悬浮控制器。在合理假设的基础上,建立了EMS型磁浮列车悬浮系统的非线性数学模型;通过反馈线性化将该非线性模型精确线性化,得到等价的线性模型,采用状态反馈的方法设计了非线性控制器。仿真结果表明,该非线性控制器的控制性能明显优于传统的局部近似线性化方法设计的控制器,对间隙干扰和负载干扰具有鲁棒性。     

关于强增生算子的有限族的强收敛定理

提出了Banach空间中非线性增生算子方程带误差的三重迭程式, 研究了多个非线性增生算子解与多个强伪压缩映象的公共不动点逼近问题, 获得 2个收敛定理。     

非线性评估中权重的敏感性分析

分析了非线性评估中权重的敏感性问题,给出了分析的思路和计算方法,并得出判断权重敏感的方法,定义了多维权重的敏感度,并由算例说明评价值的敏感性和权重的关系.     

纯方位系统TMA非线性最小二乘法——理论数学模型与常规算法

对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法:高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型:高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。     

An economic lot‐sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

离散多音调制中一种改进的动态能量分配方法

本文探讨了离散多音调制（ＤＭＴ）中的动态能量分配的特点和应用范围，并分析了几种典型的动态能量分配方法。在此基础上，本文提出了一种改进的分配方法。计算机模拟结果表明，该方法不仅降低了运算复杂度，而且性能近于最优。文章最后还探讨了动态能量分配中尚待进一步解决的问题。     

用随机仿真方法验证液体火箭发动机静特性数学模型

以某泵压式液体火箭发动机为研究对象，用试车数据对发动机静特性数学模型进行了验证，在验证模型时既考虑了外部干扰因素的实际测量误差范围和内部干扰因素的实际变化范围，又考虑了发动机参数实测量的误差范围，并且使用了随机仿真的方法。验证结果表明，发动机静特性的非线性数学模型是足够准确的，所用的计算方法是合理的。