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

针对多功能相控阵雷达任务实时调度问题,提出了一种基于采样周期分区的时间资源调度算法(记为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     

某型柴油机进气道通流特性试验研究

分析了某型柴油机气缸盖进气道流量系数和涡流比随气阀升程的变化规律,以及进气道前后的压差对流量系数和涡流比的影响.试验结果表明,该型柴油机进气系统在低负荷时可以实现较大的涡流比,从而可以改善柴油机低负荷性能.     

一类带容量限制的运输问题

考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.     

再入体过渡区气动特性预测

采用DSMC(DirectSimulationMonte Carlo)方法模拟球双锥复杂外形过渡区流动。给出了近连续区的温度与压强分布图,以及在不同Knudsen数、不同马赫数条件下球双锥表面压强系数和阻力系数的分布,并将阻力系数模拟结果与桥函数一体化估算结果进行了比较分析。     

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.     

微喷管流动的DSMC方法模拟

目前微型航天器正在积极地发展中,微喷管在其推进系统中具有重要地位,对微喷管进行进一步研究是很有必要的。运用DSMC(DirectSimulationMonte Carlo)方法从分子运动论层次对轴对称微喷管流动现象进行模拟,分析了喷管流量以及尺寸大小对喷管流动和性能的影响。研究表明,喷管流量及尺寸对流动特性和微喷管性能存在不同程度的影响。     

基于饱和度梯度的彩色序列图像光流场计算

传统的基于亮度守恒的光流法仅利用图像灰度信息进行光流求解,忽略了对包含丰富信息的色彩信息的利用。而彩色光流法虽然利用了彩色图像各通道信息,却忽略了对邻域信息的利用,造成存在各通道线性相关而无法求解的问题。同时,上述方法在光照变化时均不能得到正确的光流场估计。将基于饱和度的梯度计算方法引入灰度光流的计算方法中,提出了基于饱和度梯度的彩色光流计算方法,该方法有效地利用了彩色图像的色彩信息和邻域信息。试验结果证明：该方法提高了算法对光照变化的适应性,得到了更加精确的光流场估计,且避免了各通道线性相关的问题,为运动目标检测奠定了基础。