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晶体的角度调谐特性.这对于激光脉冲的激光参量过程的优化具有重要的意义.     

拉应力对管线钢磁导率及磁记忆信号的影响

运用数值模拟方法,对不同拉应力作用下X60管线钢的相对磁导率μσ的变化情况进行了仿真.结果表明,加载初期试件处于弹性变形阶段时,μσ值变化较大,随应力的增大μσ值迅速减小;加载超过屈服点后,μσ值变化很小,应力的增大已不再对其产生显著影响.磁记忆检测试验表明,进入塑性变形阶段后,信号曲线亦会由起初无规律性分布发展到相近...     

基于体系结构技术的部队网顶层设计

通过对部队网的概念和有关问题的探讨,分析了部队网顶层设计的全局性与整体性,构建了部队网体系结构框架,根据体系结构技术提出了部队网顶层的设计思路和设计内容,分别从作战和系统视图、技术视图等方面对部队网顶层设计进行了研究,对可能的脆弱性进行了分析,并给出了相应的应对措施,为今后基于信息系统的体系作战模式集成奠定了基础。     

混沌序列相关特性研究及在扩频通信中的应用

分别用Logistic映射和Chebyshev映射产生出混沌序列,在Matlab下进行相关性分析,再以Chebyshev映射产生的混沌序列代替传统的伪随机序列作为扩频通信系统的扩频码,在Simulink下进行扩频通信系统的仿真,综合分析了基于混沌序列的扩频系统的抗噪性能,仿真结果验证了基于混沌序列的扩频系统的抗干扰性能和混沌序列作为码的应用价值.     

基于MHD的反舰导弹预定目标选择方法

如何对编队预定目标进行自动选择,是超视反舰导弹亟待解决的一个问题.提出用基于Hausdorff距离的形状匹配理论来解决编队预定目标选择问题.平均Hausdorff距离(MHD)能够较好地比较两个点集所构成形状的相似程度.通过寻找刚体变换下的最小MHD来搜索最佳匹配位置,最后用双向最近邻准则获得对应点.仿真实验表明了算法...     

基于ICP的编队预定目标选择方法

如何对编队预定目标进行自动选择,是超视反舰导弹亟待解决的一个问题.反舰末制导雷达对编队预定目标的选择,可通过点集匹配来实现,基于此提出了一种运用ICP (Iterated Closest Point)算法进行编队预定目标选择的方法.首先通过一个粗搜索过程来确保ICP算法的初始值选取性能,然后运用ICP算法精确搜索最佳匹...