Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

基于分布式信息融合的多舰纯方位跟踪

提出一种基于信息融合的分布式多舰纯方位跟踪算法 ,该算法采用时变采样间隔的修正增益推广卡尔曼滤波器 ,用多条舰艇的舰载电子侦察设备对海上多个运动辐射源目标进行分布式纯方位跟踪融合。计算机模拟结果表明 ,该算法能满足工程应用的要求     

随机载荷下疲劳寿命预估计算方法研究

分析了一种用于随机载荷下零构件疲劳寿命预估的有效计算方法 .引入材料所吸收的弹性应变能和塑性应变能等参量 ,在等能量损伤法则下推算出稳态条件下随机载荷的等价常幅应力 ,适用于结构设计阶段和改进阶段或应力响应时间历程无法实测的情况 .     

燃气轮机的实时仿真及数据预处理

讨论了燃气轮机实时仿真及相应的数据预处理方法 ,利用容积惯性法建立了某型燃气轮机的实时仿真模型 ,在 5 86PC实现了超实时仿真 ,仿真结果和试验数据相符     

两栖装甲车静水阻力近似估算方法初探

提出了一种估算履带式两栖装甲车静水阻力的数学模型,在车辆主要参数已知的情况下,可对该型两栖车进行设计阶段的阻力预测:并针对某型两栖车进行了阻力计算。将两栖车辆的静水阻力分为摩擦阻力Rf剩余阻力Rr.等两部分,把实例估算结果与实车阻力试验结果相对比,结果表明:在该车常用航速范围内,误差较小。随着航速的提高,总阻力中摩擦阻力成份逐渐减少,而剩余阻力成份逐渐增加。     

药库管理系数据库的设计与实现

从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

舰炮火控系统反应时间与精度关系的仿真

对舰炮火控系统中反应时间和系统精度之间的关系做了简要的介绍,并论述了舰炮火控系统中时间和精度之间复杂的关系,通过分析采样点数和误差之间的关系,结合采样点数和系统反应时间之间的联系以及误差与系统精度之间的联系,引出反应时间与精度之间的某种关系,最后对从接收目标指示到给出射击诸元这个过程的各个时间段与其相对应的精度之间的关系进行计算机仿真。