潜射导弹出水过程空化流数值计算

运用Zwart-Gerber-Belamri空化模型,采用动网格和复合网格技术,提出复杂外形潜射导弹出水过程中空化流数值计算方法。对头肩部、舵面及突起物的空化生成、演化及影响因素进行分析。仿真结果表明:出水过程初期空化数降低使附体空泡迅速扩大,随后对空泡脱落与振荡的影响将更为显著;肩部以15 m/s的速度出水时产生空化并随速度上升而迅速增长,5°~10°攻角时肩空化非对称性显现;舵面空化受出水速度影响较小,攻角小于等于5°时空化面积小于全舵面积的10%,但攻角大于5°后空化面积迅速增长至50%以上;减小突起物尺寸有利于避免空化产生,突起物空化受攻角影响较小,但在高速下可诱导临近弹体产生空化。     

剪切来流条件下的涡生振荡机理的数值研究

将指数极坐标系建立在运动的圆柱上,推导了运动坐标中剪切来流条件下,涡生振荡的涡量-流函数守恒方程及其初始和边界条件,圆柱表面的水动力表达式以及圆柱振荡方程。对圆柱从静止开始振荡,到发展为稳定振荡状态进行了计算和讨论,描述了脱体涡街的发展过程,升阻力相图的连续变形和漂移,圆柱振荡和平衡位置的变化过程。并研究了涡生振荡终态随剪切度K的变化。结果表明,剪切来流给流场加入了背景涡,使圆柱的上涡增强而下涡减弱,流场的对称性被破坏。随着剪切度K的增大,涡街的倾斜程度增大,压力曲线的漂移量增大,由此导致升力的绝对值增大,圆柱的振幅增大且平衡位置向圆柱下侧的漂移也越大。     

高超声速尖双锥流动高精度数值模拟

以25°/55°尖双锥外形的高超声速低焓层流流动模拟为例,对高阶加权紧致非线性格式模拟激波/边界层干扰流动的能力进行验证和确认。空间离散采用二阶MUSCL和三阶、五阶加权紧致非线性格式,时间离散采用二阶精度双时间步方法,通量函数采用混合Roe-Rusanov,AUSMPW+,Van Leer等,对比了不同精度空间离散格式对时间、网格收敛特性和通量函数耗散特性的影响。数值模拟结果表明采用高精度空间离散格式能在较疏的网格上获得收敛解,并能消除结果对通量函数的敏感性,但收敛需要推进更久的计算时间。数值模拟结果与实验测量结果吻合良好,满足工程精度要求。     

通用装备机液系统综合检测试验平台综合信息管理系统设计与实现

探讨了通用装备机液系统综合检测试验平台综合信息管理系统在网络和功能结构、信息处理流程、数据分类和数据结构、数据传输接口等方面的设计方法,该设计方法在通用装备机液系统综合检测试验平台综合信息管理系统项目中进行了应用,取得了良好效果,为类似的综合管理信息系统的设计探索了一条有效的路径。     

Lipschitz非线性系统状态观测器设计新方法

针对Lipschitz非线性系统状态观测器,提出了一种以极小化条件数为目标准则的新的设计方法。运用梯度下降法和Slyvester方程,计算极小化条件数,优化增益矩阵和最大允许Lipschitz常数,完成观测器设计。通过同其它文献的算例比较,结果发现按文中方法设计的观测器具有迭代次数少、优化结果好的特点。     

装备维修管理系统的设计与实现

装备维修管理系统是一种新型维修管理模式,为解决现代装备协同维修过程中资源优化调度和分配的各类问题,从装备维修保障系统的需求分析入手,讨论了基于改进遗传算法的维修资源配置算法,并采用建模与仿真技术,设计实现了装备维修管理系统。     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

Modeling and analysis of multiobjective lot splitting for N‐product M‐machine flowshop lines

Lot splitting is a new approach for improving productivity by dividing production lots into sublots. This approach enables accelerating production flow, reducing lead‐time and increasing the utilization of organization resources. Most of the lot splitting models in the literature have addressed a single objective problem, usually the makespan or flowtime objectives. Simultaneous minimization of these two objectives has rarely been addressed in the literature despite of its high relevancy to most industrial environments. This work aims at solving a multiobjective lot splitting problem for multiple products in a flowshop environment. Tight mixed‐integer linear programming (MILP) formulations for minimizing the makespan and flowtime are presented. Then, the MinMax solution, which takes both objectives into consideration, is defined and suggested as an alternative objective. By solving the MILP model, it was found that minimizing one objective results in an average loss of about 15% in the other objective. The MinMax solution, on the other hand, results in an average loss of 4.6% from the furthest objective and 2.5% from the closest objective. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010