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     

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

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

无线传感器网络在环境监测中的应用

低成本、低功耗、自组网的无线传感器网络近年来得到快速发展.对近年来无线传感器网络在环境监测中的应用进展进行系统综述,对国内外各研究小组的研究成果进行对比和分析,最后对无线传感器网络的发展进行总结和展望.     

基于单发地空导弹测试数据的武器精度检验

在地空导弹命中精度检验问题中,提出了充分利用单发导弹的测试数据进行命中精度的检验。该思想是利用χ2检验法对导弹速度的瞬时误差（系统误差）的方差进行检验,并给出了在测出导弹7、9、11个轨迹点条件下的2类风险临界值表,为武器精度检验提供了一定依据。     

指挥与自动化两张皮问题研究

当前指挥自动化建设中大量存在着“指挥”与“自动化”两张皮的现象。一般认为,通过加强军事需求研究、建立军事技术联合团队、培养“指技复合型”人才,就可以克服两张皮问题。实际上,军事需求和技术实现的割裂,只是冰山一角,更长远的对策,应立足于“指挥”和“自动化”两者在理论基础、理论体系上的统一。     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于改进TOPSIS法的维修保障系统效能评估研究

维修保障系统涉及因素众多,对其进行效能评估是一项非常复杂的问题.在分析TOPSIS及其改进方法的基础上,构建了维修保障系统效能评估指标体系,应用改进TOPSIS法对维修保障系统效能进行了综合评估,并将评估结果与AHP和突变评价法的结果进行比较,结论一致.为维修保障系统效能评估问题寻求出一种新的方法,其评估结果可为决策提供定量依据.