Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

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     

飞行计划管理中航迹关联算法

针对传统飞行计划管理中的缺限,基于MK-NN航迹关联算法思想,提出了一种利用方向因子、速度因子、偏航因子、时差因子和区域因子对综合航迹和计划航迹进行比较关联的方法.通过仿真,分析比较了该算法与其它算法的综合性能,验证了MK-NN算法在计划管理中的科学性和可行性.用改进的MK-NN算法为基本算法实现对飞行计划实施的动态监控,能够提高飞行计划管理的准确性和可靠性.     

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc.     

多点喷射空气酒精燃气发生器试验验证

为有效解决现有燃气引射气源存在的诸多缺点,适应一种引射系统大流量、小型化的需要,在综合分析各燃气引射气源方案的基础上,研制了一种以空气、酒精作为推进剂的多点喷射结构的燃气发生器,并开展了多种工况下的试验研究。结果表明:采用的多点喷射方案大大提高了空间利用率,有效满足了引射系统小型化的要求;喷雾性能好,喷雾锥角及粒径优于设计指标要求;点火可靠性高,解决了领域内现有燃气发生器点火可靠性低的缺点;点火迅速,燃烧平稳,可实现较为均匀的出口温度场;燃气发生器工作范围较宽,能在余气系数2.52～4.34范围内稳定燃烧;高效的火焰筒内壁空气冷却方式有效保证了燃气发生器长时间工作运行。     

班组遥控武器站模糊自适应滑模位置控制器设计

针对班组遥控武器站位置伺服系统发射冲击力矩大、负载变化范围广和伺服精度要求高等特点,提出了一种模糊调节的位置伺服系统滑模控制策略。该策略选用了一种新型的带有积分的滑模面,模糊调节部分采用单输入双输出的结构,应用模糊规则调节新型快速终端滑模型趋近速率来削弱滑模抖振。分别进行了常值负载干扰、系统参数摄动、时变负载干扰和跟踪误差仿真实验。仿真实验表明,该控制策略的稳定性和伺服跟踪性很好,对参数摄动和负载干扰的鲁棒性很强。     

轻型反坦克导弹复合制导模式设计与仿真分析

对某型捷联惯性中制导+红外图像末制导的多用途轻型反坦克导弹的制导控制系统进行了研究,建立了制导控制方程、虚拟比例导引方程以及复合制导的交班过程方程等。结合某反坦克导弹总体参数,建立了弹体运动学模型、制导控制系统等仿真模型,并基于Matlab/Simulink和半实物仿真技术对其进行了仿真试验。试验结果表明,利用捷联惯性中制导+红外末制导复合制导的方法,可以有效提高导弹的制导精度及导弹在复杂战场上的生存能力。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

用于目标弱信号处理的三重相关匹配滤波技术

分析了在二重相关匹配滤波技术的基础上实现三重相关匹配滤波的方法。三重相关匹配滤波对于目标的弱信号进行检测和处理 ,具有广泛的实用价值。给出了一个红外搜索目标信号处理的计算机模拟结果 ,并对计算机模拟结果进行了分析 ,证明了三重相关匹配滤波技术相对于二重相关和三重相关检测技术的优越性     

可靠性增长试验费用模型研究

基于杜安模型对可靠性增长试验时间和预期所能达到的可靠性水平的基本假设,推出了可靠性增长试验费用模型,并说明了其合理性及适用性.