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.     

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     

状态机嵌入DEVS的组合建模方法研究

DEVS提供了模块化、层次化的系统建模和仿真执行框架,但是缺乏对于系统行为的抽象建模能力。状态图扩展了原有的FSM,通过可视化的、灵活的状态迁移图描述系统的复杂行为。提出将状态图嵌入DEVS的组合建模方法,互为补充,以建立复杂的离散控制系统。DEVS作为系统的建模框架并提供执行逻辑支持,状态图扩展DEVS的事件交互机制和时间推进机制,描述系统的行为逻辑。详细介绍了状态图和DEVS的语法语义,重点阐述状态图嵌入DEVS的实现机制。结合一个应用实例,说明嵌入状态图的DEVS用于建立离散控制系统模型的优势。     

基于状态反馈的导弹滚转通道变结构控制

针对导弹滚转通道参数时变性和快速性要求,提出了一种易于实现状态反馈变结构控制器的设计。将系统分为确定部分和不确定部分,然后分别对这两部分进行变结构控制。结果表明,适当的校正规则不仅保证滑模的存在,而且具有对参数扰动和外部扰动的不变性;状态信号的反馈提高了滚转通道的响应能力;伪滑模大大削减了变结构控制的抖动。并通过仿真证明了该方法的正确性和有效性。     

陆军防空导弹装备信息化改造方法

针对我国陆军现有防空导弹装备,提出了一种增加其作战效能的信息化改造方法。阐述了改造思想、改造方案,并简单讨论了改造后的陆军防空导弹构建作战体系的方式。     

陆军诸兵种合同作战兰切斯特方程的弹药消耗预测研究

描述了诸兵种合同作战的兰切斯特方程及其矩阵解,提出了一种通过兵力损耗换算弹药损耗的新思路,分析和确定了用该方法预测弹药消耗的相关参数,最后运用Matlab进行仿真计算,预测出了武器装备战损情况和弹药消耗情况。     

水面舰艇电子武备基座水平度的检验与修正

论述了舰船电子武备基座水平度的检验与修正方法,探讨了影响基座水平度变化的诸多因素及预防措施.通过建立物理模型和数学模型,提出了基座水平误差修正方法.该方法在某型导弹驱逐舰现代化改装中得到了应用,收到了良好的效果.     

改进类电磁算法在武器目标分配问题中的应用

通过基于级数的粒子编码变换方法,将武器目标分配问题的约束条件进行了化简.对原始类电磁算法,在种群初始化、局部搜索、合力计算以及粒子移动等各步骤对其进行改造,使之适应武器目标分配问题的整数解空间.最后通过数值实验验证了该改造后算法解决武器目标分配问题的有效性.     

层次化作战模型集成规范

对作战模型进行规范化描述,不仅可以使各层次模型在不同的军事想定下进行重用,而且可以使模型的建立、管理、调度进入一种标准的工程模型,更适合作战模拟的使用.分三个层次探讨作战模型集成规范,从基础模型层、模型管理层和模型使用层三个方面探讨了作战模型集成的各层规范,从而为模型使用和集成打下基础.