Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Matrix-geometric solution of discrete time MAP/PH/1 priority queue

We use the matrix-geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non-preemptive cases are considered. We show that the structure of the R matrix obtained by Miller for the Birth-Death system can be extended to our Quasi-Birth-Death case. For both preemptive and non-preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non-preemptive. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job's wait before it becomes the leading job of its priority class. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 23–50, 1998     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

不确定失效阈值影响下考虑设备剩余寿命预测信息的最优替换策略

为了进一步提升设备维修决策的科学性,通过建立综合设备剩余寿命预测数据与不确定失效阈值的最优维修决策模型,实现了不可维修设备的最优替换策略.构建基于非线性Wiener过程的设备性能退化模型,并采用极大似然法估计退化模型参数;提出一种基于期望最大(Expectation Maximization,EM)算法的不确定失效阈值...     

短切碳纤维混凝土电磁屏蔽规律的实验研究

随着电子产品普及和大功率电气设备数量的增加,导致电磁环境急剧恶化,从而带来了一系列隐患。简要阐述了电磁屏蔽的原理,介绍了碳纤维的性能,并对短切碳纤维水泥基复合材料的屏蔽性能进行了实验研究,制备出碳纤维吸波混凝土,测试了样品的电磁屏蔽性能,并比较3mm与6mm短切碳纤维在吸波混凝土中的屏蔽效能,分析、总结了实验样品中反映出来的规律,为设计高性能电磁屏蔽混凝土提供了依据。     

小波分析在电子装备供电设备故障检测中的应用

新型电子装备供电设备封装性能好,可及测点少,故障检测和诊断难度大.在分析供电设备声信号产生机理的基础上,提出了一种利用小波分析理论对声信号进行处理,实现非接触、不解体故障检测与诊断的方法.论证了频带能量分析法和极大值分析法提取故障特征信息的可行性,并给出了故障特征参数算法.实验证明,该方法能有效地检测和诊断故障.     

坦克火控系统误差分析及仿真系统设计与实现

分析了坦克火控系统的误差源,并以误差分析问题为背景,设计并实现了一个仿真平台,并将其应用于火控系统设计过程中,为精度分配算法提供支持.仿真系统应用火控系统的基本数学模型,通过模拟实际射击来获得火控系统输入误差与输出误差的传递关系,以此分析各误差源对系统精度影响的敏感程度,帮助设计者选择影响较为显著的误差源来进行修正,从而获得较高的系统精度.     

基于数据库的电子对抗作战效能分析系统的设计

介绍了基于数据库的电子对抗作战效能分析系统设计的基本思路.系统采用模块化设计,指挥员可根据不同需要添加或删减模块以达到自己的目的.同时,系统采用了双缓冲读取数据机制,很好地解决了仿真推演所需数据量大与电子对抗作战态势实时显示之间的矛盾,将无形的电磁态势以形象直观的形式显现出来,有助于指挥员加深对电子对抗这种作战手段的理解、战术的运用以及辅助作出正确的决策.     

基于故障树分析的航空装备体系结构贡献率评估方法

针对航空装备体系构成复杂的特点,将故障树分析引入航空装备体系结构贡献率评估问题,提出基于故障树分析的评估方法.从作战装备、信息支援装备和保障装备三个方面构建航空装备体系结构,建造航空装备体系结构故障树;采用底事件的关键重要度指标来计算航空装备的体系结构贡献率,建立基于关键重要度的航空装备体系结构贡献率评估模型;以某航空...     

美军装备试验鉴定发展历程分析及启示

美军装备试验经历近百年的发展,已形成较为成熟的试验鉴定模式和管理评价体制,试验鉴定能力也处于世界领先水平.美军在装备发展历程中的经验做法十分值得学习和借鉴.本文分析了美军装备试验鉴定发展历程和特点,研究了其试验组织结构的科学构成和运行机制,归纳总结了美军装备试验发展的客观规律和科学经验.在此基础上,得到了顺应装备发展趋...