Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

C2组织的通信结构优化设计与分析

指挥控制(Command and Control,C2)组织的通信结构设计是解决网络中心战条件下指控信息高效交互的核心问题.围绕C2组织通信结构的延时、可靠性及成本进行建模,在虚拟全连通网络中采用路由随机搜索的方法避免路由及拓扑的局部搜索,并基于遗传算进行全局搜索求解.实验分析表明该方法可以实现优化目标和效果.     

过程挖掘算法

过程挖掘又称工作流挖掘,主要依据日志中记录的过程实例执行信息重构工作流过程模型,是工作流再设计与分析方法的一项关键技术。对目前主流的过程挖掘算法和相关工具进行了研究,把过程挖掘算法按照特性及解决问题分成了4类,对每类算法的优缺点进行比较研究。最后指出了目前过程挖掘研究中存在的问题。     

基于多Agent协作的战场信息共享系统研究与实现

针对联合作战中分布、动态的战场环境和海量的战场信息,满足不同作战实体对战场信息资源共享的需求,构建了一个基于多智能体的、面向作战任务的信息资源共享模型,并提出了一种新颖的基于相似度的用户动态聚类方法。从用户的资源请求中发现用户兴趣和用户之间的相似度,通过交互机制有效地将相同兴趣的用户及资源智能体关联起来,提高作战主体获取战场信息的能力。实验证明该算法具有较高的效率和良好的可扩展性。     

本征模式函数与经验模式分解方法分析

介绍本征模式函数IMF满足的条件和定义,分析了经验摸式分解EMD的前提、本质及其对非线性平衡系统数据处理所体现的优越性,并以隧道采集的风力数据处理为例,对上述理论进行了验证,展示了这种新方法的作用和效果。最后,从理论上证明了所处理数据的完备性及EMD成员正交性应满足的条件。     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

组织设计方法研究：组织协作与效能

介绍了A2C2系列实验,并通过对A2C2实验1到实验5所采用组织结构、结构设计算法以及实验所获取的数据分析,重点研究了组织协作与组织效能的关系,在其实验结论(组织协作与效能关系的不确定性结论)的基础上对组织结构设计优化算法提出了改进思想。     

半隐式半Lagrangian时间积分及其可扩展并行算法设计

目前谱模式仍然是全球数值天气预报业务模式的主流。针对全球数值天气预报谱模式,研究两个时间层的半隐式半Lagrangian时间积分格式以及用于计算起始点的准三次空间插值方法,提出了按需通讯的可扩展并行算法设计,在由4个双CPUSMP结点组成的Linux机群环境下,该算法的8任务相对于4任务的加速比达到了1.65,取得了良好的并行效果。     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

2(1/2)谱在直升机声信号特征提取中的应用

介绍了四阶累积量对角切片的一种定义,分析了其傅里叶变换(212谱)在提取三次相位耦合特征方面的良好性能及其估计方法;将其应用于具有三次相位耦合的直升机声信号特征提取。仿真结果表明,利用该方法能够分析信号的三次相位耦合信息,且具有计算方法简单、运算速度快及良好的抑制高斯噪声的优点。实际的数据处理结果验证了该方法的有效性。