Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

作战数据工程建设与发展

战争形态正加速向信息化战争演变,数字化作战成为主要形式,作战数据以前所未有的深度广度进入战争全脉络,成为作战的核心,影响着战争进程甚至决定成败。习主席高度重视作战数据建设,多次指出我军数据积累严重不足是军事斗争准备的短板弱项。因此,建设完善配套的作战数据库和形成战时高效的作战数据保障能力,对获取作战信息优势、提升指挥控制能力至关重要,对于提高我军基于网络信息体系的联合作战能力具有重要的支撑作用。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

燃气轮机仿真软件构造方法综述

从方法论的角度综述了燃气轮机仿真软件的研究现状,分析了过程式方法和过程式模块化方法的不足,阐明采用面向对象方法的必要性,并对未来的发展方向作了初步探讨.     

大深度锚雷定向攻击误差分析

误差分析是计算武器射击(攻击)效果的基础,在简述了大深度锚雷工作过程和命中原理模型后,着重对其攻击过程中存在的误差进行了详细的分析,并举例进行了计算     

面向指挥自动化效能评估的仿真网格系统

根据网格思想提出一种基于HLA的仿真体系框架,整个框架分为应用层、HLA层、模糊层三层:应用层放置各种作战方案,由军事人员操作;HLA层由RTI支撑,邦元完成作战方案对模型的调用;模型层则是各种模型及其管理的集合。该框架利用DCOM技术对仿真模型资源进行管理及任务调度。RTI则负责邦元的通信及时间管理,这样将仿真模型与HLA体系分离,为大规模军事仿真提供了一种有效的方法。介绍了仿真网格系统原型,最后以潜舰作战为例,具体研究了系统实现方法。     

基于程序切片的电路提取技术

从HDL设计描述中提取电路在VLSI设计验证、低功耗分析、测试生成等方面有广泛的应用需求。提出了一种采用程序切片技术实现的新的电路提取方法,并深入论述了基于程序切片技术从Verilog描述中进行电路提取的理论基础。该方法可以为每一个感兴趣的信号获取其"链接切片"。与以前的方法相比,该方法的优点是细粒度的、不受书写格式的限制,并且能处理更多Verilog的语法元素。该方法已经被集成到现有设计流程中,实验结果表明其方便、高效,有良好的通用性。     

焊接工艺对熔敷金属韧性的影响

探讨了改变焊接工艺对焊条熔敷金属冲击韧性的影响．研究表明：改变焊接工艺,将通过改变熔敷金属的化学成分,影响熔敷金属的强度和韧性;降低焊接线能量时,将降低熔敷金属中的氧含量及其氧化夹杂物的数量和大小,从而提高熔敷金属的韧性     

舰船可靠性对维修费用的影响分析

对两类主要影响因素分别建立了相应的数学模型．依据约化理论,建立了维修费用的ＶＡＲ模型．同时,根据统计资料分析了实际舰载主要设备的故障规律,指出了传统定时维修方式的理论基础的不完整性．     

一类拟线性周期抛物边值问题

研究了一类带有小扩散系数的拟线性周期抛物混合边值问题。给出当扩散系数趋于零时其非平凡解的渐近性。