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用于建立离散控制系统模型的优势。     

基于Markov链的分布式仿真系统最佳检查点间隔研究

基于HLA的分布式仿真系统作为一类特殊的分布式系统,其容错一般基于回卷恢复实现,在回卷恢复中检查点间隔的不同会对系统性能产生很大的影响。分析了分布式仿真容错与一般分布式系统容错的异同,根据不同仿真进程对仿真结果的重要程度对其进行了分类,定义并利用Markov链分析了采用回卷恢复时分布式仿真系统的可用度,得到了系统最大可用度对应的检查点间隔的求解等式,通过一组试验数据验证了该最佳检查点间隔求解等式的正确性。     

一类非线性动力系统的时滞反馈分叉控制

对时滞控制作用下的参数激励van der Pol-Duffing方程进行了研究,着重研究了时滞参数对该类参数激励系统的1/2亚谐共振-主参数共振分叉响应控制。首先采用摄动法从理论上推导出时滞动力系统的分叉响应方程,再采用数值模拟的方法研究了时滞参数对系统分叉响应的影响。研究结果表明,适当选取时滞参数,不仅可以改变分叉响应曲线的拓扑形态,还可以平移分叉响应曲线,即使其分叉提前或滞后,还能同时满足这两种要求。     

DDS输出信号频谱结构的系统分析

首先介绍了直接数字合成(DDS)技术的基本原理和理想情况下DDS的输出信号频谱结构,然后分析了工程实际中DDS的误差信号来源,从信号与系统理论的角度解释了相位截断和幅度量化引起的DDS输出信号频谱的杂散,并在最后对D/A的非理想特性和参考时钟相位噪声的影响作了简要的说明。     

结合多层快速多极和ILUT预处理算法分析复杂目标的电磁特性

分层快速多极算法(MLFMM)和ILUT预处理算法被结合来分析电大尺寸目标的电磁散射和辐射特性。采用矩量法求解电磁场积分方程,最终须要求解一线性方程组。分层快速多极算法被用来加速用迭代法求解线性方程组时的矩阵向量乘积的运算。ILUT预处理算法被用来降低方程组系数矩阵的条件数,加快迭代法的收敛速度。计算实例表明了该方法的通用性和高效性。     

确定重构相空间维数的方法

计算混沌统计特征量前必须先获得重构相空间的维数,因此给出了最大特征值不变法、几何不变量法、虚假邻点法、预测误差最小法、最小Shannon熵法、经验赋值法六种确定方法,得出了应用最大特征值不变法和最小Shannon熵法的工程案例计算结果。     

基于遗传算法的信息系统安全技术方案

组织如何制定优化的信息安全技术方案以降低脆弱性对其信息系统的威胁,是信息安全管理领域的关键问题。在描述信息系统安全技术方案决策模型的基础上,提出了一种求解信息系统安全技术方案优化问题的自适应遗传算法,使得组织能以最少的方案实施费用最大限度地处置脆弱性,并以实例说明了该算法的有效性。