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     

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     

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.     

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     

一维热构件模型及其在船用核动力装置运行分析中的应用

建立了一维热构件模型 ,该模型具有广泛的适用性 ,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件 .方程采用隐式有限差分法求解热传导方程 ,并将模型应用于核动力装置的运行分析中 .计算结果表明 ,本文所建立的一维热构件模型能逼真地描述一维热构件的温度场分布 ,计算精度高 .     

一维热构件模型及其在船用核动力装置

建立了一雏热构件模型,该模型具有广泛的适用性,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件．方程采用隐式有限差分法求解热传导方程,并将模型应用于核动力装置的运行分析中．计算结果表明,本文所建立的一维热构件模型能逼真地描述一雏热构件的温度场分布,计算精度高．     

表面官能化对碳纳米管/环氧复合材料玻璃化转变温度及韧性的影响

通过碳纳米管的不同表面官能化,构造其与环氧树脂的不同界面。采用动态机械性能分析研究不同表面官能化碳纳米管对环氧树脂复合材料玻璃化转变温度的影响;采用摆锤冲击试验研究环氧树脂复合材料的韧性。结果表明:与纯环氧树脂相比,氨基化碳纳米管/环氧树脂复合材料的玻璃化转变温度升高,而羧基化碳纳米管/环氧树脂复合材料的玻璃化转变温度反而有所下降;碳纳米管/环氧树脂复合材料的冲击强度相比纯环氧树脂均提高了近一倍。复合材料性能的这些变化规律主要归因于不同表面官能化碳纳米管与环氧树脂基体间形成了不同的界面。     

认真搞好联合作战政工指挥人才教育训练

适应加快培养联合作战指挥人才需要,政治院校必须以高度的自觉性和强烈的紧迫感认真搞好联合作战政工指挥人才教育训练;必须紧紧围绕其核心素质能力要求,把握教育训练重点;必须注重教学力量建设,改进组训模式和教学方法,提高教育训练质量效益。     

防空C~3I系统战前辅助决策的MADM模型及框架设计

存在于Ｃ３Ｉ系统中的决策是大量且复杂的。首先详细分析了野战防空Ｃ３Ｉ系统战前决策的五个基本内容;然后,根据多属性决策（ＭＡＤＭ）理论,提出了一种统一的战前辅助决策的ＭＡＤＭ模型,并从实际出发,给出了求解随机的ＡＤＭ问题的三个适用方法;最后讨论了辅助决策系统的枢架设计及实现方法。     

有外中子源时点堆中子动力学方程组的精确解

采用去耦合法,在未作任何假定的条件下,导出了点堆中子动力方程组的精确解。此解可通用于反应堆启动,次临界、缓发超临界,一直到瞬发超临界。此解计算精度高,可用于要求计算精度较高的定量分析,计算工作量小,可用手算。对于反应堆现场运行监督性快速估计的计算,尤为适宜。