利用构造性仿真评估导弹精度

通过对导弹落点散布的构造性仿真获得了落点(均值与方差)的验前分布参数,通过与现场试验数据的相容性检验获得了验前信息的可信度,在考虑验前信息可信度的情况下获得了命中点的均值与方差的验后Bayes估计。算例表明该方法对于仿真信息的应用合理可信,考虑可信度下的Bayes估计具有较好的置信度。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

汽车维修的环境影响和绿色维修

资产维修是社会持续发展的重要技术途径,同时,维修又要消耗资源产生废弃物,对环境造成危害。汽车维修是最庞大的维修行业。以某运输团军用汽车年维修产生的废弃物的统计分析为基础,论述了推行绿色维修的重要性和紧迫性,并针对目前的维修废弃物处理方式及其危害性,从管理及回收处置方面提出了相应的改进意见。     

CsLiB6O10晶体Ⅰ型光参量过程中角度调谐研究

根据三波耦合过程中的能量动量守恒,基于非线性晶体的相位匹配理论,利用CsLiB6O10(CLBO)晶体的Sellmeier方程,详细分析了Ⅰ型共线及非共线参变过程中CLBO晶体的角度调谐特性.这对于激光脉冲的激光参量过程的优化具有重要的意义.     

低压终端线路无功补偿技术

随着经济发展,低压终端线路,特别是住宅负荷中,无功需求急剧增加。基于这一现状,提出了低压终端线路无功补偿问题。分析探讨了终端无功补偿设备与传统补偿设备的差异及应具的技术和特色,构划了系统总体设计方案,明确了该装置开发研究中应关注的主要问题及处理措施,指出开发专门终端无功补偿的必要性和紧迫性,为低压终端线路补偿装置的研制奠定了基础。     

应用型工程力学教学方法的探索与实践

应用型工程力学教学模式主要包括四种有代表性的教学方法,即:生动形象教学法、贴近日常生活事例教学法、贴近具体工程教学法、重大工程事故教学法。     

“协同教学法”在边防检查专业实践教学中的应用

在边防检查专业教学中,＂协同教学法＂是加强专业实践教学环节,使学生把知识转化为能力的有效途径。这一教学方法在边检专业实践教学的课前准备、教学实施、课后小结环节中得到充分体现,并推动教学活动的开展。