Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于内角流动的板式表面张力贮箱内推进剂流动过程研究

分析了在微重力环境下,板式表面张力贮箱内推进剂的流动和定位过程.利用VOF方法对贮箱内推进剂的重定位过程进行了仿真计算,验证了贮箱及PMD的推进剂管理性能.用数学方法分析了液体在导流板的内角流动,用解析计算的方法求出流动过程中液面的长度,并和仿真计算结果进行了对比.因为实际的贮箱模型比较复杂,仿真计算结果和理论计算结果存在一定的误差,但其流动趋势保持一致.本文的工作能够为内角流动的研究提供有益的参考.     

一种面向复杂地理空间栅格数据处理算法并行化的任务调度方法

随着并行计算技术的成熟,地理空间栅格数据处理算法的并行化研究成为新的热点。聚焦于处理流程包含多个计算步骤的复杂地理空间栅格数据处理算法,基于空间计算域理论,提出了一个随着算法处理流程而动态变化的任务调度方法。实验证明,该方法在算法流程的每一个计算步都会调整任务分组方案,因此相比于传统任务调度方法,任务调度的负载均衡效果更好,并行算法程序的运行时间更短。     

基于STK的动能反卫作战信息流程构建

介绍了动能反卫星武器的信息系统构成及功能,对动能反卫作战过程进行了描述,提出了动能反卫作战中的信息需求,构建了动能反卫作战行动的信息流程。详细介绍了动能反卫星作战流程,并对作战信息需求进行分析。最后,利用卫星工具包(STK)实现一次对地基动能反卫星作战过程的仿真。     

Brill流型的脉冲防暴水炮发射管内气液两相流流型

搭建了脉冲防暴水炮气液两相流动力研究的模化实验平台,对水炮发射管进行可视化研究的改装,通过高速摄影机来拍摄发射管内气液两相流气液界面运动的行为。简化了水炮的三维物理模型,应用OpenFOAM软件自带的大涡数值模拟模型(LES)对发射管内气液两相流进行流场仿真,得到了流型的演变过程。数值模拟结果显示脉冲防暴水炮发射管内气液两相动力过程的流型演变规律为:开始阶段为冲击流,但持续时间极为短暂;然后演变为环状流,持续时间较长;最后为气液掺混阶段的雾状流。数值模拟结果与实验结果吻合良好。     

脉冲防暴水炮非淹没气体射流的RANS和LES模拟

为提高脉冲防暴水炮刺激剂的雾化水平,必须提高射流的出口速度和改善雾化带形状,而这些因素与管内非淹没气体射流的湍流流场息息相关。为准确描述湍流分布和水柱加速过程,对脉冲防暴水炮的非淹没气体射流进行了RANS和LES模拟。结果表示LES模型较RANS的标准k-ε模型能更为精确地描述湍流分布和管内非淹没气体射流速度的各向异性。但两者对于水柱加速过程的描述基本一致,只是由于LES模型的气液参混较为充分,气液速度相差较小,而可能导致两模型气体在喷口膨胀规律的异同。LES模型气液界面复杂,是用于研究管内气液流型的理想方法。该方法为三维模拟打下了较好的基础,所得结果可以作为管外射流研究的初始条件。     

基于分簇理论的信息流优化算法研究

将导弹防御指控网络看作变拓扑结构网络,引入小世界网络中"簇"的概念,以最短作战响应时间为优化指标,提出了一种基于平均连接度自适应分簇算法的信息流优化算法。仿真结果表明,该算法在保证信息优裕度的前提下,提高了信息可达度和信息交互质量,提高了指控网络遭受打击时的重构能力。     

压力喷嘴常温下雾化特性实验研究

为了满足工程中对喷嘴雾化特性测量的高精度、低成本要求,建立了喷嘴雾化特性实验系统,以自来水为雾化工质,对蒸发冷却压力喷嘴在常温、常压下的雾化特性进行了实验研究。用容积法测量了喷嘴的流量,用最小二乘法对测量数据进行回归分析,得到了喷嘴流量、雾化压力和喷孔直径之间的关联式与流量系数;用机器视觉方法测量了喷嘴的雾化锥角与雾滴尺寸,得到了雾化锥角与雾滴尺寸随雾化压力变化的规律。结果表明:随着雾化压力的增大,喷嘴雾化锥角不断增加,雾滴尺寸不断减小;随轴向距离的增大,D0.632、D0.5、D32有不同幅度的增大,而D0.9则基本不变。