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     

基于中间表示规则替换的二进制翻译中间代码优化方法

动态二进制翻译在实现多源到多目标的程序翻译过程中,为屏蔽不同源平台间的硬件差异引入中间代码,采用内存虚拟策略进行实现,但同时带来中间代码膨胀问题。传统的中间代码优化方法主要采用对冗余指令进行匹配删除的方法。将优化重点聚焦在针对特殊指令匹配的中间表示规则替换上,提出了一种基于中间表示规则替换的二进制翻译中间代码优化方法。该方法针对中间代码膨胀所呈现的几种典型情景,描述了中间表示替换规则,并将以往应用在后端代码优化上的寄存器直接映射策略应用在此处。通过建立映射公式,实现了将原来的内存虚拟操作替换为本地寄存器操作,从而降低了中间代码膨胀率。使用SPEC CPU2006测试集进行了实验,验证了此优化方法的正确性和有效性。测试用例在优化前和优化后的执行结果一致,验证了优化方法的正确性;优化后测试用例的中间代码平均缩减率达到32.59%,验证了优化方法的有效性。     

面向任务指控系统时延分析模型及其改进

面向任务指挥控制系统是为了完成一个或多个作战任务,而将现有的相关指控系统互联互通形成网络,各种作战信息可以在网络中传输和共享的动态构建的系统.现代高技术战争模式下,时间延迟是评价面向任务的指挥控制系统构成的一项重要指标.通过指控节点的图模型,分析面向任务指控系统的结构及其中各种命令流、信息流的特点,采用网络信息熵来反映指控节点网络对信息的协调能力.通过研究和分析已有时延模型的缺点,并考虑实际应用的条件,对模型的惩罚函数进行了改进.     

基于XML的装备维修信息标准化

基于XML的装备维修信息标准化是我军装备信息保障的发展趋势.以设备技术说明书为例,对其进行了标准化信息分解,构建了相应的DTD和数据库结构,并讨论了实现标准化维修信息动态传输与交换的相关问题.     

国外先进战斗机电子对抗系统的发展

首先介绍国外F-22和F-35为代表的先进战斗机的电子战系统和其他欧洲先进战斗机的电子战系统等发展情况。对未来战斗机电子战系统的综合特点和基本功能进行了比较详细的分析和描述,最后叙述了未来战斗机的航空电子系统将设计成为一体化共平台,电子战系统与一体化的航空电子系统融合成为一个功能系统,并描述了这种先进的电子战系统的作战能力。     

部队作战效能综合评估法

高技术条件下局部战争的显著特点是参战单位多、对抗关系复杂、战争不确定因素增加,如何在此情况下客观评估部队的作战效能是作战研究领域一个重点和难点。通过综合运用定性分析法、网络分析法、战斗效能指数法、作战模拟及系统动力学等多种方法和理论,建立了一种可对部队作战效能进行评估的综合评估法。并以高技术条件下岛上进攻作战中装甲团的作战效能评估为例,详细介绍了该方法的实施过程,认为该综合评估法是行之有效的。     

航空轮胎用橡胶弹性体Mullins效应动态加载方法

航空轮胎用橡胶弹性体在服役过程中遭受严苛的动态循环工况。为了研究弹性体在此工况下的力学响应特征和损伤机理,提出基于应力波作用的Mullins效应动态加载实验方法。根据应力波传导与作用特征,采用Hopkinson压杆加载思路,设计和配置了各单元尺寸参数,进而搭建可用于橡胶弹性体材料动态循环加载的实验系统,并开展了航空轮胎用丁苯橡胶的动态循环加载试验。基于试验信号分析发现：加载系统实现了弹性体材料Mullins效应动态应变递增的试验加载。最后开展加载测试参数的影响因素分析,结果表明通过优化系统各单元可实现Mullins效应的动态加、卸载参数的控制。     

Scheduling maintenance and semiresumable jobs on a single machine

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999     

CRF与规则相结合的军事命名实体识别研究

作战命令的分词是作战指令自动化生成、文图转换等各种指挥自动化技术的重要基础。在作战指令进行分词处理的过程中,军事命名实体的识别是技术难点之一。命名实体是信息的主要载体,它的识别是军事信息抽取的关键。提出了一种基于CRF模型与规则相结合的命名实体识别方法,结合基本特征与外部词典特征,提高了实体识别效率;在后期进行规则优化,最终实现高效的命名实体识别。实验证明,该方法是行之有效的。能够成功解决命名实体的自动识别问题。     

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