Openshop scheduling under linear resources constraints

Consider n jobs (J₁, …, J_n), m working stations (M₁, …, M_m) and λ linear resources (R₁, …, R_λ). Job J_i consists of m operations (O_i1, …, O_im). Operation O_ij requires P_k(i, j) units of resource R_k to be realized in an M_j. The availability of resource R_k and the ability of the working station M_h to consume resource R_k, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998     

Open shop scheduling to minimize the number of late jobs

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are ordered. For the m machine common due date problem, we assume that one machine is maximal and impose a restriction on its load. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 525–532, 1998     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

A heuristic for the two‐machine no‐wait openshop scheduling problem

In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999     

大型柔性起竖臂的有限元建模与分析

针对使用中的振动问题,基于ANSYS软件平台建立某大型柔性起竖臂合理的有限元模型,获得其固有振动特性、刚度和强度等设计数据。分析表明,使用中出现的振动现象是由于外载荷频率接近起竖臂一阶固有频率所致,而起竖臂刚度和强度设计整体合理,但存在局部应力集中和强度设计偏于保守的问题。     

基于信息损失最小的预警卫星传感器调度模型

科学合理地调度预警卫星传感器资源是提高弹道导弹预警作战效能的重要手段.在预警卫星传感器资源(主要是凝视探测器)有限而进攻弹道导弹目标数量较多时,利用最小信息损失准则,将传感器调度问题转化为最优访问路径问题进行建模研究,满足了导弹预警资源调度的需要,仿真结果验证了模型的可靠性和可用性.     

精确保障的理论研究与发展

根据未来信息化战争的新特点,探讨了适应信息化战争保障需求、基于信息网络技术、资源重构技术、柔性保障机制和系统理论的精确保障的内涵,研究归纳出当今美军装备保障的特点、提出精确保障的理论研究应该充分借鉴系统理论、网络中心战理论、敏捷制造理论的先进思想,指出了我军精确保障实现的途径以及应该遵循的原则.     

基于时间窗的宽带阵列多目标干扰资源调度

随着宽带数字阵列技术和有源干扰技术的不断发展和成熟,舰载有源干扰设备的未来发展方向将是宽带数字阵列有源干扰系统。针对多目标干扰问题,提出了目标干扰时间窗概念和两种时间窗的处理方法,并建立干扰资源调度模型,通过仿真计算和对比分析,得出基于模糊时间窗的资源调度模型性能优于基于硬时间窗的资源调度模型,能够对干扰资源进行合理的调度,提高宽带阵列多目标干扰能力。     

磁致伸缩作动器的位置跟踪补偿控制

为提高磁致伸缩作动器控制精度,以 Jiles-Atherton 磁滞和动力学模型为基础,通过优化偏执磁场和预紧力来提高作动器线性度,并基于前馈控制、PID 反馈控制及柔性神经网络理论,提出了前馈补偿 PID 及柔性神经网络前馈补偿 PID 控制策略。同时,以偏置正弦和阶跃为指令信号,研究作动器的位置跟踪和补偿控制。仿真表明：相比常规 PID 控制和前馈补偿 PID 控制,柔性神经网络前馈补偿 PID 控制具有更好的位置跟踪效果和抗干扰能力,具有无振荡、无超调、响应速度快的特点。