基于灰色预测的时敏军事任务调度模型

为有效利用栅格化军事信息系统硬件冗余资源,提高系统运行时效,保证时敏军事任务执行效果,基于灰色理论的GM(1,1),提出了一种时敏军事任务调度模型。构建了基于主动式主/副本机制的调度流程,并针对普通(阈值)调度模型和模糊控制调度模型中调度触发的滞后和调度价值不确定的问题,设计了预测型调度时间窗口,有效优化了调度触发机制。最后通过仿真实验,考察了3种调度模型的有效性,结果表明模型虽然耗费了较大的调度开销,但在降低总体任务用时上作用明显。     

一种基于周期分区的时间调度算法

针对多功能相控阵雷达任务实时调度问题,提出了一种基于采样周期分区的时间资源调度算法(记为PD)。该算法以各类任务采样周期的最大公约数为分区标准,将各采样周期均分为多个等长区间,再将各类任务平均分配到不同分区中调度执行,可解决调度过程中任务因采样周期不同产生冲突的难题。仿真结果表明,该算法可提高系统任务调度能力,可广泛应用于相控阵雷达任务调度及其他实时任务调度系统。     

Multiproduct batching and scheduling with buffered rework: The case of a car paint shop

We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014     

Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014     

基于单应轨迹的视频实时稳像算法

针对视频稳像中实时任务的需求特点,提出一种基于单应轨迹的视频稳像算法。估计序列图像帧间的单应变换,并将该变换作用于图像窗口的4个角点,从而对每帧图像产生4个短的单应轨迹以代表视频短时间内的运动。利用关联卡尔曼滤波器以一种连续方式对不同帧的单应轨迹进行平滑。对图像合成采用包括性和相似约束以提高结果视频的可观性质量。该算法以在线方式工作,消除了缓存输入图像帧导致的延迟,具备不依赖于复杂的3D重建和长距离特征跟踪的优点,并有效避免了单应模型表达视频运动模型的误差积累问题。实验表明该算法能够有效对包含2D和较复杂3D场景的视频进行稳像,并且能够达到实时处理速度。     

Lot streaming with supplier–manufacturer coordination

Lot splitting refers to breaking a production lot into smaller sublots during production. Coordinating lot splitting decisions across multiple stages of a production process is a challenging task. Traditional lot splitting and lot streaming models implicitly assume that the entire system is operated and owned by the same firm, or there exists a coordinator who controls the operation of all machines in the system. In this paper, we consider the situation where the machines in a multiple‐stage production process are owned and managed by different companies. Every item in a given production lot has to go through the processing by the supplier's machine, followed by the manufacturer's machine, and so on. We develop and analyze coordination mechanisms that enable different parties in the supply chain to coordinate their lot splitting decisions so as to achieve a systemwide optimum. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

车辆运动模拟器运动参数实时监测系统

针对车辆运动模拟器运动参数的实时测量要求研制了一套计算机实时在线监测系统,介绍了监测系统的组成和功能,通过对车辆运动模拟器油缸位移的分析,推导了模拟器运动参数的理论解算方法,并从数据通讯、处理和管理等方面对监测软件进行分析与设计,从而实现了模拟器运动参数监测模式的多样化。     

利用空闲独占技术解决定时问题

Windows操作系统以DOS系统所无法比拟的优势广泛运用于软件开发中,而其本身的非严格实时性难以解决实时处理系统的定时问题。对基于Windows操作系统空闲独占技术提高Windows操作系统实时处理速度的可行性进行了研究,提出了一种不增加硬件开销在Delphi5开发平台下实现精确定时的方法,最后给出了该技术在网上雷达模拟训练实时系统中的应用结果。     

基于运动学模型的灵巧成像卫星观测摆角算法

针对灵巧成像卫星对地面目标观测摆角的计算问题,考虑地球自转和卫星在轨运动等约束,利用空间坐标变换建立了基于椭球体的空间运动学模型.在此模型的基础上,给出了任意时刻卫星对目标观测摆角的计算方法.仿真结果验证了方法的正确性.任意时刻观测摆角的获取为灵巧成像卫星任务调度提供支持.